- Bitonic Sort is a classic parallel algorithm for sorting
- Bitonic sort does O(n Log 2n) comparisons
- The number of comparisons done by Bitonic sort are more than popular sorting algorithms like Merge Sort [ does O(nLogn) comparisons], but Bitonice sort is better for parallel implementation because we always compare elements in predefined sequence and the sequence of comparison doesn’t depend on data. Therefore it is suitable for implementation in hardware and parallel processor array
- Bitonic Sort must be done if number of elements to sort are 2^n. The procedure of bitonic sequence fails if the number of elements are not in aforementioned quantity precisely
- This java example shows how to sort an element of Java ArrayList using Bitonic Sort method of Collections class.
- The program firstly assign some values including person's atttributes to its object and performs sort process in terms of each attribute title. All sort process is implemented by Turkish alphabetical order.
- src
- bitonicsort
- BitonicSortProcess.java
- main
- Main.java
- model
- Person.java
- util
- DefineValues.java
- ShowProcess.java
- bitonicsort
| Files Names | Information |
|---|---|
| BitonicSortProcess.java | Implementing BitonicSort Sort Process by Turkish alphabetical order |
| Person.java | Defining it as a POJO |
| Main.java | Handle with all project files to run the program |
| ShowProcess.java | Showing all information about Person Object as output |
| DefineValues.java | Filling its attributes into Person Object |