Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,289,906 papers from all fields of science
Search
Sign In
Create Free Account
Burstsort
Burstsort and its variants are cache-efficient algorithms for sorting strings and are faster than radix sort for large data sets of common strings…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Dynamic array
HAT-trie
List of algorithms
Radix sort
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Engineering burstsort: Toward fast in-place string sorting
Ranjan Sinha
,
Anthony Wirth
JEAL
2010
Corpus ID: 16410080
Burstsort is a trie-based string sorting algorithm that distributes strings into small buckets whose contents are then sorted in…
Expand
2010
2010
Perbandingan Waktu Proses Pengurutan Data String dengan Algoritma Burstsort dengan Implementasi Struktur Data Linked list dan Struktur Data Array
S. mirah
,
P. Ayu
2010
Corpus ID: 60814988
Algoritma Burstsort memiliki kompleksitas n log n. String-string yang akan diurutkan disisipkan ke dalam Bursttrie sesuai dengan…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE