Sorting and Searching

Sorting and searching are fundamental operations in computer science and are essential for solving many real-world problems efficiently. Sorting algorithms allow us to arrange elements in a specific order, while searching algorithms help us locate elements within a collection.

Sorting Algorithms

There are various sorting algorithms available, each with its own advantages and disadvantages. Some commonly used sorting algorithms include:

• Bubble Sort
• Selection Sort
• Insertion Sort
• Merge Sort
• Quick Sort

These sorting algorithms have different time complexities, which determine their efficiency for different input sizes. For example, bubble sort and selection sort have a time complexity of O(n^2), while merge sort and quick sort have a time complexity of O(n log n).

Here's an example of sorting an array in Java using the built-in Arrays.sort method:

1import java.util.Arrays;
2
3public class Main {
4  public static void main(String[] args) {
5    // replace with your Java logic here
6    int[] arr = {5, 2, 10, 8, 1};
7    System.out.println("Original Array: " + Arrays.toString(arr));
8
9    // Sort the array
10    Arrays.sort(arr);
11
12    System.out.println("Sorted Array: " + Arrays.toString(arr));
13  }
14}

Searching Algorithms

Once a collection is sorted, we can perform efficient searching using algorithms like binary search. Binary search works by repeatedly dividing the search space in half until the target element is found or determined to be absent.

Here's an example of searching for an element in a sorted array in Java using the built-in Arrays.binarySearch method:

1import java.util.Arrays;
2
3public class Main {
4  public static void main(String[] args) {
5    // replace with your Java logic here
6    int[] arr = {1, 2, 5, 8, 10};
7    int searchValue = 8;
8
9    // Search for the element
10    int index = Arrays.binarySearch(arr, searchValue);
11
12    if (index >= 0) {
13        System.out.println("Found " + searchValue + " at index " + index);
14    } else {
15        System.out.println("Element not found");
16    }
17  }
18}

Remember, the choice of sorting and searching algorithms depends on the specific requirements of your problem and the characteristics of your data.

xxxxxxxxxx

class Main {

  public static void main(String[] args) {

    // replace with your Java logic here

    int[] arr = {5, 2, 10, 8, 1};

    System.out.println("Original Array: " + Arrays.toString(arr));

    Arrays.sort(arr);

    System.out.println("Sorted Array: " + Arrays.toString(arr));

​

    int searchValue = 8;

    int index = Arrays.binarySearch(arr, searchValue);

    if (index >= 0) {

        System.out.println("Found " + searchValue + " at index " + index);

    } else {

        System.out.println("Element not found");

    }

  }

}