Binary Search Sort Algorithm -Yet Another Sorting Algorithm with Binary Search having O(nlogn) and O(n) time complexity

The Binary search sort algorithm makes use of Binary Search and dynamically constructs a sorted array which is of O(N Log N) time complexity. The approach is not an in-place sorting technique but makes use of external space -which takes the advantage of parallel sorting strategies. The paper describes the detailed algorithm implementation with Pseudocode and improvements. The approach relies on discarding intermediate results and reduces time complexity. Applications of Binary Search Sort Algorithm with grouping techniques enhance the sorting speed while optimizing search speed too. A variation of the sorting approach by applying Parallel Binary Search Sort technique mathematically and theoretically runs with O(n) linear time complexity -one of the fastest sorting approaches that could be applied on High Performance Hardware.