https://github.com/amari-calipso/staticsort

a distributive sorting algorithm with low time complexity
https://github.com/amari-calipso/staticsort

algorithm distribution-sort distribution-sorting python python3 sorting sorting-algorithm sorting-algorithms

Last synced: 2 months ago
JSON representation

a distributive sorting algorithm with low time complexity

• Host: GitHub
• URL: https://github.com/amari-calipso/staticsort
• Owner: amari-calipso
• License: mit
• Created: 2021-08-21T14:32:23.000Z (over 3 years ago)
• Default Branch: main
• Last Pushed: 2024-12-08T20:26:55.000Z (5 months ago)
• Last Synced: 2024-12-19T18:49:17.664Z (4 months ago)
• Topics: algorithm, distribution-sort, distribution-sorting, python, python3, sorting, sorting-algorithm, sorting-algorithms
• Language: Python
• Homepage:
• Size: 14.6 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# staticSort

time complexity:

best case = O(n)

average case = O(n) + s

where s is best approximated like this and is a number between n and n log n:

![image](https://github.com/amari-calipso/staticSort/assets/68780017/1563800e-b189-4282-a84d-5df7b80494f0)

worst case = O(n log n)

space complexity = O(n)