" I built a Sorting algorithm and that is just insane here is the features down below "
- Guaranteed O(n log n) in every case
- It is Better for worst - case scenarios --- in sorted arrays it is 24X faster than the QuickSort ----------
- It is stable , Unlike Heapsort
- AND MOST IMPORTANT Bideractional Traversal (ex:- it can print backward where no other sorting algorithms cant do
:- Real world Applications
- Financial Trading
- Database Indexing:- Self-balancing maintains sorted index
- Competitive Programming: Guarantees no TLE on worst case
it can sort n = 100, 000 inputs in less than a 10ms
Stay tunned for full publications 🚀
Top comments (0)