Burstsort
cache-efficient algorithm for sorting strings
Press Enter · cited answer in seconds
0 sources
Burstsort
Summary
Burstsort is a sorting algorithm[1]. Burstsort draws 14 Wikipedia views per month (sorting_algorithm category, ranking #24 of 29).[2]
Key Facts
- Burstsort's instance of is recorded as sorting algorithm[3].
- Burstsort's Freebase ID is recorded as /m/02rgkg1[4].
- Burstsort's uses is recorded as trie[5].
- Burstsort's worst-case time complexity is recorded as O(wn)[6].
- Burstsort's worst-case space complexity is recorded as O(wn)[7].
- Burstsort's Microsoft Academic ID is recorded as 2776393919[8].
Body
Designation and Status
Burstsort's instance of is recorded as sorting algorithm[3].
Why It Matters
Burstsort draws 14 Wikipedia views per month (sorting_algorithm category, ranking #24 of 29).[2]