Burstsort

cache-efficient algorithm for sorting strings
Intangible Sorting Algorithm Q5000665

Facts

4 properties
Worst-case space complexity
O(wn)[4]
Worst-case time complexity
O(wn)[3]
🏷️ Also known as
en Burstsort fa مرتب‌سازی انفجاری
🔖 Identifiers · 2
Freebase ID
/m/02rgkg1
Microsoft Academic ID (discontinued)
2776393919

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
Instance of 1
Uses 1
Press Enter · cited answer in seconds

Summary

Burstsort is a sorting algorithm[1].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.
  2. [3] ↑ . wikidata.org.
  3. [4] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Burstsort. Retrieved November 15, 2026, from https://4ort.xyz/entity/burstsort
MLA “Burstsort.” 4ort.xyz Knowledge Graph, 4ort.xyz, 15 Nov. 2026, https://4ort.xyz/entity/burstsort.
BibTeX @misc{4ortxyz_burstsort_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Burstsort}}, year = {2026}, url = {https://4ort.xyz/entity/burstsort}, note = {Accessed: 2026-11-15}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Burstsort — https://4ort.xyz/entity/burstsort (retrieved 2026-11-15)

Canonical URL: https://4ort.xyz/entity/burstsort · Last refreshed: