Tag: programming
Public whispers tagged programming
Text Highlight2026-08-11 18:38:48
Original Highlight Excerpt
"a comparison sort cannot perform better than O(n log n) on average"
Whisper Note
So that's why my custom sort is always slower than the built-in.
Text Highlight2026-08-11 12:32:48
Original Highlight Excerpt
"the output of any sorting algorithm must satisfy two conditions"
Whisper Note
Even the definition sounds like a math test I'd fail.
Text Highlight2026-08-11 12:23:48
Original Highlight Excerpt
"the output of any sorting algorithm must satisfy two conditions"
Whisper Note
So that's why my custom sort broke — missed condition two.
Text Highlight2026-08-11 12:14:48
Original Highlight Excerpt
"the output of any sorting algorithm must satisfy two conditions"
Whisper Note
Two conditions? I thought it was just 'small to big' and done.
Text Highlight2026-08-11 03:09:57
Original Highlight Excerpt
"List comprehensions provide a concise way to create lists."
Whisper Note
List comprehensions are such a game changer, way cleaner than loops.
Text Highlight2026-08-11 03:09:18
Original Highlight Excerpt
"A Foolish Consistency is the Hobgoblin of Little Minds"
Whisper Note
Classic quote, still makes me think twice about over-obsessing with style.
Text Highlight2026-08-09 21:09:57
Original Highlight Excerpt
"error handling is intuitive"
Whisper Note
Error handling being intuitive is a huge win, honestly.
Text Highlight2026-08-09 21:09:18
Original Highlight Excerpt
"Flat is better than nested."
Whisper Note
The flat is better than nested one really hits home with every refactor I do.
Text Highlight2026-08-09 19:35:41
Original Highlight Excerpt
"Hashing is an example of a space–time tradeoff."
Whisper Note
Ha, the infinite time option sounds like my last interview coding challenge.
Text Highlight2026-08-09 19:26:41
Original Highlight Excerpt
"Hashing is an example of a space–time tradeoff."
Whisper Note
But if memory was infinite, why would anyone bother with hashing anyway?
Text Highlight2026-08-09 16:32:41
Original Highlight Excerpt
"In a well-dimensioned hash table, the average time complexity for each lookup is independent of the number of elements stored"
Whisper Note
Average is the key word—worst case is still a nightmare though.
Text Highlight2026-08-09 16:23:41
Original Highlight Excerpt
"In a well-dimensioned hash table, the average time complexity for each lookup is independent of the number of elements stored"
Whisper Note
This is why databases use them under the hood for lookups.
Text Highlight2026-08-09 16:14:41
Original Highlight Excerpt
"In a well-dimensioned hash table, the average time complexity for each lookup is independent of the number of elements stored"
Whisper Note
Depends on the hash function, if it's bad you're back to O(n).
Text Highlight2026-08-06 03:09:18
Original Highlight Excerpt
"this is the correct code."
Whisper Note
lol that else always trips me up, good catch.
Text Highlight2026-08-04 21:09:18
Original Highlight Excerpt
"When appropriate"
Whisper Note
Good point, sync order makes debugging way easier.
Text Highlight2026-08-03 15:09:18
Original Highlight Excerpt
"If a call to stream."
Whisper Note
the drain event thing always trips me up, good to see it explained clearly.
Text Highlight2026-08-02 09:09:18
Original Highlight Excerpt
"curl http://localhost:11434/api/chat"
Whisper Note
curl command straight into terminal, love how simple it is.
Text Highlight2026-07-29 15:09:18
Original Highlight Excerpt
"the actual result is [1, NaN, NaN]"
Whisper Note
classic gotcha, always forget the radix
Text Highlight2026-07-28 16:33:53
Original Highlight Excerpt
"There is built-in syntax to compute a depth- or breadth-first sort column."
Whisper Note
Finally, no more hand-rolling recursive CTE sorting!
Text Highlight2026-07-28 16:11:42
Original Highlight Excerpt
"Move semantics enable the transfer of resources and ownership between objects"
Whisper Note
This is exactly why modern C++ feels so much safer than the old pointer juggling days.