Radix sort - Wikipedia
, where is the number of keys, and is the key length. In computer science, radix sort is a non-comparative sorting algorithm. It avoids comparison by creating and distributing elements into buckets according to their radix. For elements with more than one significant digit, this bucketing process is repeated for each digit, while preserving the ordering of the prior step, until all digits have bee
Here's Some Working Code to Sort One Million 8-Digit Numbers in 1MB of RAM
Earlier this week, this Stack Overflow question was featured on Reddit under /r/programming. Apparently, it was once a Google interview question – or at least, a variation of one: You have a computer with 1M of RAM and no other local storage. You must use it to accept 1 million 8-digit decimal numbers over a TCP connection, sort them, and then send the sorted list out over another TCP connection.
Sorting 1 million 8-decimal-digit numbers with 1 MB of RAM
I have a computer with 1 MB of RAM and no other local storage. I must use it to accept 1 million 8-digit decimal numbers over a TCP connection, sort them, and then send the sorted list out over another TCP connection. The list of numbers may contain duplicates, which I must not discard. The code will be placed in ROM, so I need not subtract the size of my code from the 1 MB. I already have code to
Tabasco Sort: a super-optimal merge sort - Paul Khuong: some Lisp
EDIT: 2012-08-29: I added a section to compare comparison counts with known bounds for general comparison sorts and sorting networks. In an earlier post, I noted how tedious coding unrolled sorts can be. Frankly, that’s the main reason I stopped at leaf sorts of size three. Recently, Neil Toronto wrote a nice post on the generation of size-specialised merge sorts. The post made me think about that
Radix Sort Revisited
Pierre Terdiman Last revision: 04.01.2000 In every decent programmer’s toolbox lies a strange weapon called a Radix Sort. Where does it come from ? Who invented it ? I don’t know. As far as I can remember it was there, fast, easy, effective. Really effective. So unbelievably useful I’ve never really understood why people would want to use something else. The reasons ? Most of the time, they tell m
Sorting Algorithms
Sorting Algorithms Demonstration in Java I wrote little of this code, and take no responsibility (nor credit) for any of it. If you have any other sorting algorithms you would like to see included on this list please send them to mailinglistsandjunkmailandcrap@wcgwave.ca. Demo Applet Algorithm Name Running Time (Efficiency) Stability Method Other notes Best Average Worst
GitHub - iwiwi/parallel-string-radix-sort: A parallelized implementation of optimized MSD radix sort for strings
概要 MSD Radix Sort による 文字列ソートを OpenMP を用いて並列化した実装です． const char* の配列か，std::string の配列をソートできます． 参考文献の論文に書かれている高速化手法である Loop Fission や Super-Alphabet 等のテクニックや， 配列のコピーを減らす工夫等が導入されています． 使い方 sample.cc や measure.cc を見ると大体分かると思います． コンパイル時に -fopenmp を付けないと並列化されないので注意してください． 逆に，-fopenmp を付けないで，並列化せずに使用することもできます． そのような状況でも std::sort より有意に高速だと思います． 性能 measure.cc で 3 千万個のランダム文字列 (const char*) のソートの時間を測ります． 文字列
GitHub - iwiwi/parallel-radix-sort: An implementation of optimized parallel radix sort
概要 OpenMP を用いて並列化した Radix Sort です． また，参考文献の論文で提案されている高速化手法である Buffer based scheme を採用しています． キーのみのソートと，キー・値のペアのソートができます． キーとして，以下の型がとれます． 符号付き整数 (char, short, int, long, long long) 符号なし整数 (上のに unsigned がついたもの) 浮動小数点数 (float, double) 使い方 sample.cc や measure.cc を見ると大体分かると思います． コンパイル時に -fopenmp を付けないと並列化されないので注意してください． 性能 measure.cc で 2 億要素の int 配列のソートの時間を測ります． 実行例: % g++ -O3 measure.cc -fopenmp % ./a
Heapsort, Quicksort, and Entropy
Numerous web-pages compare heapsort and quicksort. Most of them say something along the lines of `both take an average time scaling as N log N, but A good implementation of QUICKSORT usually beats HEAPSORT in practice.' Some take this folklore a bit further, giving quantitative details: `On average the number of comparisons done in HEAPSORT is about twice as much as in QUICKSORT, but HEAPSORT avoi
Merge sort - Wikipedia
In computer science, merge sort (also commonly spelled as mergesort) is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the relative order of equal elements is the same in the input and output. Merge sort is a divide-and-conquer algorithm that was invented by John von Neumann in 1945.[2] A detailed description and
Sort Benchmark Home Page
New: The deadline for the 2023 sort contest is 31 December 2023. Background Until 2007, the sort benchmarks were primarily defined, sponsored and administered by Jim Gray. Following Jim's disappearance at sea in January 2007, the sort benchmarks have been continued by a committee of past colleagues and sort benchmark winners. The Sort Benchmark committee members include: Chris Nyberg of Ordinal Te
cortesi - Cyclesort - a curious little sorting algorithm
One of the nice things about building sortvis.org and writing the posts that led up to it is that people email me with pointers to esoteric algorithms I've never heard of. Today's post is dedicated to one of these - a curious little sorting algorithm called cyclesort. It was described in 1990 in a 3-page paper by B.K. Haddon, and has become a firm favourite of mine. Cyclesort has some nice propert
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
GitHub - BonzaiThePenguin/WikiSort: Fast and stable sort algorithm that uses O(1) memory. Public domain.
K-sort: A new sorting algorithm that beats Heap sort for n <= 70 lakhs!