The latest articles on DEV Community by Mahesh kumar Acharya (@mahesh_kumaracharya_8373). https://dev.to/mahesh_kumaracharya_8373 https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F3711388%2Fe66974c5-6a86-4cff-adbf-de9f736a7e0f.jpeg https://dev.to/mahesh_kumaracharya_8373 en Mahesh kumar Acharya Wed, 14 Jan 2026 17:25:18 +0000 https://dev.to/mahesh_kumaracharya_8373/new-sorting-algorithm--220k https://dev.to/mahesh_kumaracharya_8373/new-sorting-algorithm--220k <p>" <strong><em>I built a Sorting algorithm and that is just insane here is the features down below</em></strong> "</p> <ol> <li>Guaranteed O(n log n) in every case </li> <li>It is Better for worst - case scenarios --- in sorted arrays it is 24X faster than the QuickSort ----------</li> <li>It is stable , Unlike Heapsort </li> <li>AND MOST IMPORTANT Bideractional Traversal (ex:- it can print backward where no other sorting algorithms cant do</li> </ol> <p><strong>:- Real world Applications</strong> </p> <ol> <li>Financial Trading </li> <li>Database Indexing:- Self-balancing maintains sorted index</li> <li>Competitive Programming: Guarantees no TLE on worst case</li> </ol> <p>it can sort n = 100, 000 inputs in less than a 10ms<br> Stay tunned for full publications 🚀</p> programming news