☑️ Day 8/100: #Leetcode daily question

🟨 Question: 179. Largest Number

Today's question was good and can be answered using a custom sorting function. I did this with 3 approaches:
1. Built-in sort (provided custom key fn).
2. #quicksort
3. #MergeSort

🐈‍⬛ Check out my #GitHub where I post all the daily streak 🔥 questions and #LeetcodeContest 🏆 solutions

🔗 Solution Link: https://github.com/akshatsingh1718/leetcode/tree/main/largestNumber

🔗 My Leetcode Github: https://github.com/akshatsingh1718/leetcode

#coding #python #sorting

Vandaag was er weer mijn favorietje momentje in mijn intro-vak over algoritmen ... de QuickSort song! #kuleuven #informatica #quicksort https://youtu.be/2HjspVV0jK4?si=IbuQN8z---AxT7-e

I edited some code from a teacher and implemented #quicksort in pure structured #C, with clean coding standards!

This is on my site, and I'll share the link after the due date of the homework that this is part of.

#quicksort #TonyHoare #Nachruf #IT

@brunorocher @Chrisso @etienne_cdl
Rêve de plaisant tri
#ironeme #quicksort

I'm surprised neither #Copilot nor #ChatGPT4 can write #Quicksort in #REXX. Might be a good testbed for learning how to fine-tune, e.g., #CodeLlama. (Assuming CL doesn't know REXX either.) How much code for syntax to "take"?

Looking forward to sorting some red #MagicCards. #QuickSort

Randomness did me bad when showing off #QuickSort on Monday.

Now (7pm ET Wed) watch https://youtu.be/g_xpA_mZFkk(FEEL FREE TO SUBSCRIBE TO YOUTUBE
@hajiaghayi
FOR FUTURE LESSONS)
Lesson 15: Introduction to Algorithms by Mohammad Hajiaghayi: #quicksort and #expected #runningtime #analysis and #lowerbounds for #sorting

Worked through a #quicksort example in #ruby https://github.com/cseeman/algorithm_examples/blob/main/lib/quicksort.rb that really helped me understand how the mechanics of the recursion, and the how of the sorting.

So this week in #algorithms we (#wnbrb) read about #quicksort . I think this chapter (Chapter 5, Algorithms Illuminated Part 1 The Basics) is my favorite so far. How to partition was broken down clearly, picking a pivot point was dare I say it, interesting, and the math wasn't actually too intimidating.

Altijd een leuk deel in de les over het #quicksort #algoritme: aantonen dat Quicksort gemiddeld ~1.39nlog2(n) aantal vergelijkingen tussen elementen uitvoert om een array van n elementen te sorteren. #kuleuven #informatica

Ich hab grade #Quicksort mit #TDD in #Java implementiert! Besser spät als nie 😝.
Das Buch "Clean Craftsmanship" hat mich motiviert, mich wieder mit TDD zu beschäftigen, und ich muss sagen: Bis jetzt klingt es wirklich sinnvoll.

#Quicksort explained with #Romanian #dance :

https://www.youtube.com/watch?v=ywWBy6J5gz8

En kijk’s aan … mijn favoriete #algoritme staat er in. #quicksort #informatica

> なぜ1950年代の言語が時代遅れにならないか.. それが技術じゃなくて数学だった.. 数学は色あせない。 Lispを比較する対象は.. クイックソートのアルゴリズムだ。それは1960年に発見され、 いまだに汎用ソートアルゴリズムとして最速だ。
> ... the short explanation of why this 1950s language is not obsolete is that it was not technology but math, and math doesn't get stale. The right thing to compare Lisp to is.. the #Quicksort algorithm.. discovered in 1960.. still the fastest general-purpose sort.
http://www.practical-scheme.net/trans/icad-j.html
#Lisp #Scheme #Racket #Classics #PaulGraham #ShiroKawai #GaucheScheme

Quasi random flatten a tree better than random seeds could #quicksort

I've heard that the origin of the #Quicksort algorithm is an old #hungarian #folkdance, and here is the proof: https://www.youtube.com/watch?v=ywWBy6J5gz8

This is the sound of #sorting. In this case #quicksort. Amazing idea.