Performing Binary Search on Java double Array Example : 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. JavaFX 25. JDK 6 26. JDK 7 27. JNDI LDAP 28. JPA 29. JSP 30. JSTL 31. Language Basics 32. Network Protocol 33. PDF RTF 34. Reflection 35. Regular Expressions 36. Scripting 37. Security 38. Servlets 39. Spring 40. Swing Components 41. Swing JFC 42. SWT JFace Eclipse 43. Threads 44. Tiny Application 45. Velocity 46. Web Services SOA 47. XML

Java » Collections Data Structure » Sort Search   Performing Binary Search on Java double Array Example       import java.util.Arrays; public class Main {   public static void main(String[] args) {     double doubleArray[] = { 1.3, 2.1, 4.7, 5.3 };     Arrays.sort(doubleArray);     double searchValue = 4.7;     System.out.println(Arrays.binarySearch(doubleArray, searchValue));     searchValue = 3.33;     System.out.println(Arrays.binarySearch(doubleArray, searchValue));   } }                            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. Recursive Binary Search Implementation in Java 20. Topological sorting 21. Heap sort 22. Sort Numbers 23. A quick sort demonstration algorithm 24. Performing Binary Search on Java byte Array Example 25. Performing Binary Search on Java char 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.