Java Collection How to - Sort integers in unsorted array and do binary search

• Back to Array  ↑

Question

We would like to know how to sort integers in unsorted array and do binary search.

Answer

import java.util.Arrays;
//  www. ja  v  a  2s .c  o  m
public class Main {

  public static void main(String[] args) {
    int[] unsorted = { -3, 10, -4, 11, 5, 1, 2 };
    System.out.println(Arrays.toString(unsorted));
    int[] sorted = unsorted;
    Arrays.sort(sorted);
    System.out.println(Arrays.toString(sorted));
    int breakingPoint = Arrays.binarySearch(sorted, 5);
    for (int i = breakingPoint; i < sorted.length; i++) {
      System.out.println(sorted[i]);
    }
  }

}

The code above generates the following result.

• Back to Array  ↑