Div sort is a new hybrid sorting algorithm developed by me. It perform the most suitable sorting operations on the data based on the state of data by first judging it in O(n) time for faster sorting time with reduced time complexity. It combines elements from Count sort, Quick sort, Merge sort, Bubble sort and have some additional logic of it's own. I have implemented the algorithm in Python 3. Time complexity: best : o(n) average : ⊘(nlogn) worst : O(nlogn)
-
Notifications
You must be signed in to change notification settings - Fork 0
Div sort is a new hybrid sorting algorithm developed by me. It performs the most suitable sorting operations on the data according to the type and state of data by first judging it in O(n) time for faster sorting time with reduced time complexity. It combines elements from Count sort, Quick sort, Merge sort, Bubble sort and have some additional …
divyanshbhojane/Div-Sort
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Div sort is a new hybrid sorting algorithm developed by me. It performs the most suitable sorting operations on the data according to the type and state of data by first judging it in O(n) time for faster sorting time with reduced time complexity. It combines elements from Count sort, Quick sort, Merge sort, Bubble sort and have some additional …
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published