الترتيب والبحث في Java

static int linearSearch(int[] arr, int target) {
  for (int i = 0; i < arr.length; i++) {
    if (arr[i] == target) return i;
  }
  return -1;
}

int[] nums = {10, 25, 30, 45, 60};
System.out.println(linearSearch(nums, 30)); // 2

import java.util.Arrays;

int[] nums = {10, 25, 30, 45, 60};
int index = Arrays.binarySearch(nums, 45);
System.out.println(index); // 3

static void bubbleSort(int[] arr) {
  int n = arr.length;
  for (int i = 0; i < n - 1; i++) {
    boolean swapped = false;
    for (int j = 0; j < n - i - 1; j++) {
      if (arr[j] > arr[j + 1]) {
        int temp = arr[j];
        arr[j] = arr[j + 1];
        arr[j + 1] = temp;
        swapped = true;
      }
    }
    if (!swapped) break;
  }
}

static void selectionSort(int[] arr) {
  int n = arr.length;
  for (int i = 0; i < n - 1; i++) {
    int minIdx = i;
    for (int j = i + 1; j < n; j++) {
      if (arr[j] < arr[minIdx]) minIdx = j;
    }
    int temp = arr[i];
    arr[i] = arr[minIdx];
    arr[minIdx] = temp;
  }
}

import java.util.Arrays;

int[] nums = {5, 2, 8, 1, 9};
Arrays.sort(nums);   // ترتيب تصاعدي
System.out.println(Arrays.toString(nums)); // [1, 2, 5, 8, 9]

import java.util.Arrays;
import java.util.Comparator;

String[] names = {"سارة", "أحمد", "محمد"};
Arrays.sort(names, Comparator.comparingInt(String::length));
System.out.println(Arrays.toString(names)); // [أحمد, سارة, محمد]