imogen heapsort
February 7, 2025 at 11:12 AM
imogen heapsort
Heapsort is an inplace sort with good complexity characteristics! Try that!
Narrator: Someone once tried to heapsort papers by hand. The doctors are very optimistic about his eventual return to society.
Narrator: Someone once tried to heapsort papers by hand. The doctors are very optimistic about his eventual return to society.
August 17, 2026 at 1:13 AM
Heapsort is an inplace sort with good complexity characteristics! Try that!
Narrator: Someone once tried to heapsort papers by hand. The doctors are very optimistic about his eventual return to society.
Narrator: Someone once tried to heapsort papers by hand. The doctors are very optimistic about his eventual return to society.
android_therapy.exe
Using several incomplete #pixelSorting techniques.
#HeapSort #ShellSort #QuickSort #MergeSort #Coding #Processing #pixelSort #pixel
Using several incomplete #pixelSorting techniques.
#HeapSort #ShellSort #QuickSort #MergeSort #Coding #Processing #pixelSort #pixel
September 15, 2024 at 5:15 PM
android_therapy.exe
Using several incomplete #pixelSorting techniques.
#HeapSort #ShellSort #QuickSort #MergeSort #Coding #Processing #pixelSort #pixel
Using several incomplete #pixelSorting techniques.
#HeapSort #ShellSort #QuickSort #MergeSort #Coding #Processing #pixelSort #pixel
i complain because i am unhappy, blossoms heapsort, the subject fractures
March 15, 2024 at 4:05 PM
i complain because i am unhappy, blossoms heapsort, the subject fractures
![Limit (cost=39157.17..39157.42 rows=100 width=48) (actual time=8391.807..8391.825 rows=100 loops=1)
-> Sort (cost=39157.17..39238.78 rows=32645 width=48) (actual time=8391.806..8391.818 rows=100 loops=1)
Sort Key: "time" DESC
Sort Method: top-N heapsort Memory: 51kB
-> Index Scan using index_posts_on_repo_and_time on posts (cost=0.70..37909.50 rows=32645 width=48) (actual time=3.146..8366.955 rows=85463 loops=1)
Index Cond: (((repo)::text = ANY ('{.....}'::text[])) AND ("time" > '2024-12-12 17:13:38.936885'::timestamp without time zone))
Planning Time: 205.380 ms
Execution Time: 8391.872 ms
Nested Loop (cost=3177.14..3456.32 rows=100 width=535) (actual time=323.717..332.358 rows=100 loops=1)
-> HashAggregate (cost=3176.57..3177.57 rows=100 width=8) (actual time=323.511..323.535 rows=100 loops=1)
Group Key: posts_1.id
Batches: 1 Memory Usage: 24kB
-> Limit (cost=3175.07..3175.32 rows=100 width=16) (actual time=323.465..323.483 rows=100 loops=1)
-> Sort (cost=3175.07..3252.00 rows=30772 width=16) (actual time=323.464..323.473 rows=100 loops=1)
Sort Key: posts_1."time" DESC
Sort Method: top-N heapsort Memory: 31kB
-> Index Only Scan using index_posts_on_repo_time_id on posts posts_1 (cost=0.70..1998.99 rows=30772 width=16) (actual time=2.388..315.589 rows=85966 loops=1)
Index Cond: ((repo = ANY ('{.....}'::text[])) AND ("time" > '2024-12-12 21:49:32.938327'::timestamp without time zone))
Heap Fetches: 240
-> Index Scan using posts_pkey on posts (cost=0.57..2.79 rows=1 width=535) (actual time=0.088..0.088 rows=1 loops=100)
Index Cond: (id = posts_1.id)
Planning Time: 133.972 ms
Execution Time: 332.709 ms](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:oio4hkxaop4ao4wz2pp3f4cr/bafkreigmbrnytruw66crfvanoryif3tlu5vgld55csuympygdml62dej3i)
let me implement heapsort in piet so i can figure out if it is in fact maximal
September 24, 2024 at 12:49 AM
let me implement heapsort in piet so i can figure out if it is in fact maximal
Good post. Good name - heapsort is the best sort.
I can tell a patient is autistic because you ask what their pain is from 1-10 while they're in excruciating pain from kidney stones and they're like "this is entirely subjective, how would I even know what a 10 feels like if I've never experienced it?" and every neurotypical person just tells you 11
March 9, 2025 at 3:36 PM
Good post. Good name - heapsort is the best sort.
I usually pick:
- the default library sorting algorithm, or
- implement INSERTION SORT for "small" datasets, or
- implement mergesort if I need stability, otherwise
- implement heapsort.
But again, it heavily depends on the context.
- the default library sorting algorithm, or
- implement INSERTION SORT for "small" datasets, or
- implement mergesort if I need stability, otherwise
- implement heapsort.
But again, it heavily depends on the context.
March 17, 2025 at 3:58 PM
I usually pick:
- the default library sorting algorithm, or
- implement INSERTION SORT for "small" datasets, or
- implement mergesort if I need stability, otherwise
- implement heapsort.
But again, it heavily depends on the context.
- the default library sorting algorithm, or
- implement INSERTION SORT for "small" datasets, or
- implement mergesort if I need stability, otherwise
- implement heapsort.
But again, it heavily depends on the context.
(Also very tangentially reminding me of a faster heapsort algorithm I wrote as a PhD student, where the 'trick' was trying to insert the new number to be sifted into the place that (on average or most likely) was close to where it ought to be.)
March 15, 2025 at 8:33 AM
(Also very tangentially reminding me of a faster heapsort algorithm I wrote as a PhD student, where the 'trick' was trying to insert the new number to be sifted into the place that (on average or most likely) was close to where it ought to be.)
Heap Sort algorithm with step-by-step Python and JavaScript implementations. #heapsort
Heap Sort Algorithm: Your Complete Implementation Guide
hackernoon.com
November 15, 2024 at 9:02 AM
Heap Sort algorithm with step-by-step Python and JavaScript implementations. #heapsort
O meu heapsort ele verifica se ja ta ordenado antes de criar a maxheap 😎
October 15, 2024 at 9:57 PM
O meu heapsort ele verifica se ja ta ordenado antes de criar a maxheap 😎
So, the heap I invented over the weekend was introduced as the quickheap by Navarro and Paredes around 2006!
Basically: on each pop, do just enough quicksort to find the smallest element.
My implementation (the 1st??) is 2x to 4x faster than d-ary and binary heaps.
curiouscoding.nl/posts/quickh...
Basically: on each pop, do just enough quicksort to find the smallest element.
My implementation (the 1st??) is 2x to 4x faster than d-ary and binary heaps.
curiouscoding.nl/posts/quickh...
August 11, 2025 at 11:32 PM
So, the heap I invented over the weekend was introduced as the quickheap by Navarro and Paredes around 2006!
Basically: on each pop, do just enough quicksort to find the smallest element.
My implementation (the 1st??) is 2x to 4x faster than d-ary and binary heaps.
curiouscoding.nl/posts/quickh...
Basically: on each pop, do just enough quicksort to find the smallest element.
My implementation (the 1st??) is 2x to 4x faster than d-ary and binary heaps.
curiouscoding.nl/posts/quickh...
Pixel sorting using #heapSort by hue values.
Pixel=hue+brightness+saturation
Heapsort is an in-place algorithm, but it is not a stable sort. It is an improved selection sort that divides its input using a heap data structure (sorted vs unsorted region).
#pixelSorting #pixelSort #Coding #Processing
Pixel=hue+brightness+saturation
Heapsort is an in-place algorithm, but it is not a stable sort. It is an improved selection sort that divides its input using a heap data structure (sorted vs unsorted region).
#pixelSorting #pixelSort #Coding #Processing
September 29, 2024 at 3:49 PM
Pixel sorting using #heapSort by hue values.
Pixel=hue+brightness+saturation
Heapsort is an in-place algorithm, but it is not a stable sort. It is an improved selection sort that divides its input using a heap data structure (sorted vs unsorted region).
#pixelSorting #pixelSort #Coding #Processing
Pixel=hue+brightness+saturation
Heapsort is an in-place algorithm, but it is not a stable sort. It is an improved selection sort that divides its input using a heap data structure (sorted vs unsorted region).
#pixelSorting #pixelSort #Coding #Processing
Robert Floyd (8.06.1936 - 25.09.2001)
US-amerikanischer Informatiker/Turing-Preisträger
Algorithmus von Floyd und Warshall: Finden der kürzesten Wege in einem Graphen
Floyd-Steinberg-Algorithmus: Parsen und Bildbearbeitung
Bottom-Up-Heapsort
Programmverifikation mittels logischer Zusicherungen
US-amerikanischer Informatiker/Turing-Preisträger
Algorithmus von Floyd und Warshall: Finden der kürzesten Wege in einem Graphen
Floyd-Steinberg-Algorithmus: Parsen und Bildbearbeitung
Bottom-Up-Heapsort
Programmverifikation mittels logischer Zusicherungen
September 25, 2024 at 12:00 AM
Robert Floyd (8.06.1936 - 25.09.2001)
US-amerikanischer Informatiker/Turing-Preisträger
Algorithmus von Floyd und Warshall: Finden der kürzesten Wege in einem Graphen
Floyd-Steinberg-Algorithmus: Parsen und Bildbearbeitung
Bottom-Up-Heapsort
Programmverifikation mittels logischer Zusicherungen
US-amerikanischer Informatiker/Turing-Preisträger
Algorithmus von Floyd und Warshall: Finden der kürzesten Wege in einem Graphen
Floyd-Steinberg-Algorithmus: Parsen und Bildbearbeitung
Bottom-Up-Heapsort
Programmverifikation mittels logischer Zusicherungen
J'ai programmé un tri par tas (heapsort), qui en théorie est en n log n. Je mesure, je fitte une courbe, on dirait que je suis en n^1.3
Qu'ai-je encore fait.
Qu'ai-je encore fait.
March 12, 2024 at 9:13 PM
J'ai programmé un tri par tas (heapsort), qui en théorie est en n log n. Je mesure, je fitte une courbe, on dirait que je suis en n^1.3
Qu'ai-je encore fait.
Qu'ai-je encore fait.
Today (as in yesterday):
Math n°2: Limits, continuity exercises. Next up derivatives, convexity, and sequences.
Info n°2: Quicksort, heaps, heapsort, priority queues (just heaps really), definitions for complexity notations (O, Ω, Θ, o, ω). Next up methods for expliciting recurrence expressions.
Math n°2: Limits, continuity exercises. Next up derivatives, convexity, and sequences.
Info n°2: Quicksort, heaps, heapsort, priority queues (just heaps really), definitions for complexity notations (O, Ω, Θ, o, ω). Next up methods for expliciting recurrence expressions.
July 29, 2025 at 11:21 PM
Today (as in yesterday):
Math n°2: Limits, continuity exercises. Next up derivatives, convexity, and sequences.
Info n°2: Quicksort, heaps, heapsort, priority queues (just heaps really), definitions for complexity notations (O, Ω, Θ, o, ω). Next up methods for expliciting recurrence expressions.
Math n°2: Limits, continuity exercises. Next up derivatives, convexity, and sequences.
Info n°2: Quicksort, heaps, heapsort, priority queues (just heaps really), definitions for complexity notations (O, Ω, Θ, o, ω). Next up methods for expliciting recurrence expressions.
Diferença de tempo de execução de um sqrtsort com insertionsort e um sqrtsort com Heapsort
O 10^8 com o insertionsort nem terminou de executar
O 10^8 com o insertionsort nem terminou de executar
September 2, 2024 at 4:23 PM
Diferença de tempo de execução de um sqrtsort com insertionsort e um sqrtsort com Heapsort
O 10^8 com o insertionsort nem terminou de executar
O 10^8 com o insertionsort nem terminou de executar
Interesting - comparing rpi zero 2/w vs esp8266/32 running MPy, comment on native code emitter:
"I did some very quick follow up experiments, and could get 100x improvement with bubble sort using Viper emitter, and 1000x by also switching to heapsort."
author also compares mpy-c-rust-js elsewhere
"I did some very quick follow up experiments, and could get 100x improvement with bubble sort using Viper emitter, and 1000x by also switching to heapsort."
author also compares mpy-c-rust-js elsewhere
Benchmarking MicroPython
In the Q&A session following my EuroPython 2025 presentation about the Microdot web framework, a member of the audience asked me what the performance of MicroPython running on a microcontroller…
blog.miguelgrinberg.com
November 9, 2025 at 12:21 PM
Interesting - comparing rpi zero 2/w vs esp8266/32 running MPy, comment on native code emitter:
"I did some very quick follow up experiments, and could get 100x improvement with bubble sort using Viper emitter, and 1000x by also switching to heapsort."
author also compares mpy-c-rust-js elsewhere
"I did some very quick follow up experiments, and could get 100x improvement with bubble sort using Viper emitter, and 1000x by also switching to heapsort."
author also compares mpy-c-rust-js elsewhere
Shakersort, Heapsort
Radixsort, Selectionsort
Die sind alle weniger interessant. Radix ist und bleibt ein Hexenwerk...
Radixsort, Selectionsort
Die sind alle weniger interessant. Radix ist und bleibt ein Hexenwerk...
September 3, 2026 at 5:01 PM
Shakersort, Heapsort
Radixsort, Selectionsort
Die sind alle weniger interessant. Radix ist und bleibt ein Hexenwerk...
Radixsort, Selectionsort
Die sind alle weniger interessant. Radix ist und bleibt ein Hexenwerk...
Your month, your algorithm:
1. Binary tree inorder traversal
2. Merge sort for linked lists
3. Bellman-Ford
4. AVL tree insertion
5. Floyd-Warshall
6. Quicksort
7. Dijkstra
8. Karatsuba
9. Disjoint set find with path compression
10. Heapsort
11. Depth-first search
12. Bucket sort
1. Binary tree inorder traversal
2. Merge sort for linked lists
3. Bellman-Ford
4. AVL tree insertion
5. Floyd-Warshall
6. Quicksort
7. Dijkstra
8. Karatsuba
9. Disjoint set find with path compression
10. Heapsort
11. Depth-first search
12. Bucket sort
August 24, 2026 at 7:49 AM
Your month, your algorithm:
1. Binary tree inorder traversal
2. Merge sort for linked lists
3. Bellman-Ford
4. AVL tree insertion
5. Floyd-Warshall
6. Quicksort
7. Dijkstra
8. Karatsuba
9. Disjoint set find with path compression
10. Heapsort
11. Depth-first search
12. Bucket sort
1. Binary tree inorder traversal
2. Merge sort for linked lists
3. Bellman-Ford
4. AVL tree insertion
5. Floyd-Warshall
6. Quicksort
7. Dijkstra
8. Karatsuba
9. Disjoint set find with path compression
10. Heapsort
11. Depth-first search
12. Bucket sort
Vale has yet to heapsort the prosecutor because they're unchilding Invis in Monday! 🏚
July 12, 2026 at 10:50 AM
Vale has yet to heapsort the prosecutor because they're unchilding Invis in Monday! 🏚
Dijkstra is known for heapsort, which hardly anyone can understand. So I suspect Dijkstra had a ‘high IQ’. But he still could admit that he was too stupid to follow what van Wijngaarden was saying.
July 6, 2026 at 12:18 PM
Dijkstra is known for heapsort, which hardly anyone can understand. So I suspect Dijkstra had a ‘high IQ’. But he still could admit that he was too stupid to follow what van Wijngaarden was saying.