Performing Binary Search on Java byte Array Example : Sort Search « Collections Data Structure « Java

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 Tutorial
Java Source Code / Java Documentation
Java Open Source
Jar File Download
Java Articles
Java Products
Java by API
Photoshop Tutorials
Maya Tutorials
Flash Tutorials
3ds-Max Tutorials
Illustrator Tutorials
GIMP Tutorials
C# / C Sharp
C# / CSharp Tutorial
C# / CSharp Open Source
ASP.Net
ASP.NET Tutorial
JavaScript DHTML
JavaScript Tutorial
JavaScript Reference
HTML / CSS
HTML CSS Reference
C / ANSI-C
C Tutorial
C++
C++ Tutorial
Ruby
PHP
Python
Python Tutorial
Python Open Source
SQL Server / T-SQL
SQL Server / T-SQL Tutorial
Oracle PL / SQL
Oracle PL/SQL Tutorial
PostgreSQL
SQL / MySQL
MySQL Tutorial
VB.Net
VB.Net Tutorial
Flash / Flex / ActionScript
VBA / Excel / Access / Word
XML
XML Tutorial
Microsoft Office PowerPoint 2007 Tutorial
Microsoft Office Excel 2007 Tutorial
Microsoft Office Word 2007 Tutorial
Java » Collections Data Structure » Sort SearchScreenshots 
Performing Binary Search on Java byte Array Example
    

import java.util.Arrays;

public class Main {
  public static void main(String[] args) {
    byte bArray[] 124};
    Arrays.sort(bArray);

    byte searchValue = 2;

    int intResult = Arrays.binarySearch(bArray, searchValue);
    System.out.println("Result of binary search of 2 is : " + intResult);

    searchValue = 7;
    intResult = Arrays.binarySearch(bArray, searchValue);
    System.out.println("Result of binary search of 3 is : " + intResult);
  }
}

   
    
    
    
  
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 DemoSimple Sort Demo
5. A simple applet class to demonstrate a sort algorithm
6. Sorting an array of StringsSorting an array of Strings
7. Simple version of quick sortSimple version of quick sort
8. Combine Quick Sort Insertion SortCombine Quick Sort Insertion Sort
9. Quick sort with median-of-three partitioningQuick sort with median-of-three partitioning
10. Fast Quick Sort
11. Selection sortSelection sort
12. Insert Sort for objectsInsert Sort for objects
13. Insert sortInsert sort
14. Bubble sortBubble sort
15. Merge sortMerge sort
16. Fast Merge Sort
17. Binary SearchBinary Search
18. Shell sortShell sort
19. Recursive Binary Search Implementation in Java
20. Topological sortingTopological sorting
21. Heap sortHeap sort
22. Sort NumbersSort Numbers
23. A quick sort demonstration algorithmA quick sort demonstration algorithm
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. Customized Sort Test
36. FastQSorts the [l,r] partition (inclusive) of the specfied array of Rows, using the comparator.FastQSorts the [l,r] partition (inclusive) of the specfied array of Rows, using the comparator.
37. A binary search implementation.
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.