Sahil Bhutto
Sahil Bhutto @SahilB58967 ·
Today, I just learned Quick Sort. Moving to a "Divide & Conquer" approach is amazing. Seeing the efficiency jump from O(n²) to O(n log n) is a game-changer. 3 key phases: • Pick a pivot • Partition the array • Recursively sort both sides #DSA #Java #QuickSort
7
warrior_ap
warrior_ap @aakasjh ·
RIP Tony Hoare the mind behind Quicksort, Hoare Logic, and CSP. His work shaped programming languages, concurrency, and how we reason about correct software. A giant whose ideas will keep running in every codebase.#Quicksort
40
Inflictt
Inflictt @Saksham1172975 ·
Replying to @Saksham1172975
Thread 4 / 4 Day 59/365 🚀 – QuickSort Implementation (DAA Lab) Revised QuickSort with partition logic. Chose pivot Two pointer partition Recursively sort left & right Divide and conquer in action Time: Avg → O(n log n) Worst → O(n²) #Algorithms #QuickSort #DAA #Sorting
16
Hemant Kumar Gola
Hemant Kumar Gola @HemantGola66481 ·
🚀 Day 19/30 – DSA Challenge Quick Sort + Kth Element practice today 💪 ✅ Quick Sort (Partition logic) ✅ Divide & Conquer ✅ In-place sorting ✅ Time Complexity → O(n log n) ✅ Kth smallest/largest using Quick Select Improving #DSA #Java #QuickSort #Coding #100DaysOfCodewS
66
Anshul Kumar Gond
Anshul Kumar Gond @zenitsushah ·
Day 8 🚀Today I practiced and revised sorting algorithms, diving deeper into Quick Sort. 📷Learned how partitioning works 📷Strengthened my understanding of recursion Quick Sort really shows the power of divide‑and‑conquer! #sort #QuickSort1wt
5