Recursive Binary Search Implementation in Java : Sort Search « Collections Data Structure « Java

Home Java 1. 2D Graphics GUI 2. 3D 3. Advanced Graphics 4. Ant 5. Apache Common 6. Chart 7. Class 8. Collections Data Structure 9. Data Type 10. Database SQL JDBC 11. Design Pattern 12. Development Class 13. EJB3 14. Email 15. Event 16. File Input Output 17. Game 18. Generics 19. GWT 20. Hibernate 21. I18N 22. J2EE 23. J2ME 24. JDK 6 25. JNDI LDAP 26. JPA 27. JSP 28. JSTL 29. Language Basics 30. Network Protocol 31. PDF RTF 32. Reflection 33. Regular Expressions 34. Scripting 35. Security 36. Servlets 37. Spring 38. Swing Components 39. Swing JFC 40. SWT JFace Eclipse 41. Threads 42. Tiny Application 43. Velocity 44. Web Services SOA 45. XML

Java » Collections Data Structure » Sort Search Screenshots  Recursive Binary Search Implementation in Java      public class Main {   public static final int NOT_FOUND = -1;   public static int binarySearch(Comparable[] a, Comparable x) {     return binarySearch(a, x, 0, a.length - 1);   }   private static int binarySearch(Comparable[] a, Comparable x, int low, int high) {     if (low > high)       return NOT_FOUND;     int mid = (low + high) / 2;     if (a[mid].compareTo(x) < 0)       return binarySearch(a, x, mid + 1, high);     else if (a[mid].compareTo(x) > 0)       return binarySearch(a, x, low, mid - 1);     else       return mid;   }   public static void main(String[] args) {     int SIZE = 8;     Comparable[] a = new Integer[SIZE];     for (int i = 0; i < SIZE; i++)       a[i] = new Integer(i * 2);     for (int i = 0; i < SIZE * 2; i++)       System.out.println("Found " + i + " at " + binarySearch(a, new Integer(i)));   } }                       Related examples in the same category 1. Linear search 2. Animation for quick sort 3. Quick Sort Implementation with median-of-three partitioning and cutoff for small arrays 4. Simple Sort Demo 5. A simple applet class to demonstrate a sort algorithm 6. Sorting an array of Strings 7. Simple version of quick sort 8. Combine Quick Sort Insertion Sort 9. Quick sort with median-of-three partitioning 10. Fast Quick Sort 11. Selection sort 12. Insert Sort for objects 13. Insert sort 14. Bubble sort 15. Merge sort 16. Fast Merge Sort 17. Binary Search 18. Shell sort 19. Topological sorting 20. Heap sort 21. Sort Numbers 22. A quick sort demonstration algorithm 23. Performing Binary Search on Java byte Array Example 24. Performing Binary Search on Java char Array Example 25. Performing Binary Search on Java double Array Example 26. Performing Binary Search on Java float Array Example 27. Performing Binary Search on Java int Array Example 28. Performing Binary Search on Java long Array Example 29. Performing Binary Search on Java short Array 30. Sort items of an array 31. Sort an array of objects 32. Sort a String array 33. Sort string array with Collator 34. Binary search routines 35. FastQ Sorts the [l,r] partition (inclusive) of the specfied array of Rows, using the comparator. 36. A binary search implementation. 37. Handles QuickSort and all of its methods. 38. Implements QuickSort three different ways 39. A quick sort algorithm to sort Vectors or arrays. Provides sort and binary search capabilities. 40. Returns an array of indices indicating the order the data should be sorted in.