Day 87 ✅ – Count & Radix Sort Revision • Revised Count Sort fundamentals & use cases • Revisited Radix Sort (digit-wise sorting with Count Sort) • Focused on stability, time & space complexity LeetCode Qs: 242 #100DaysOfCode #DSA #Java #CountSort #RadixSort #HashMap #LeetCode

Day 87 ✅ – Count & Radix Sort Revision • Revised Count Sort fundamentals & use cases • Revisited Radix Sort (digit-wise sorting with Count Sort) • Focused on stability, time & space complexity LeetCode Qs: 242 #100DaysOfCode #DSA #Java #CountSort #RadixSort #HashMap #LeetCode

Day 86 ✅ – Radix Sort Algorithm • Learned Radix Sort (digit-wise sorting using Count Sort) • Understood buckets, stability & complexity • Implemented Radix Sort LeetCode Qs: 13 (HashMap & optimized approach) #100DaysOfCode #DSA #Java #Sorting #RadixSort #HashMap #LeetCode

Big-O de espaço me preocupo dependendo da situação, como é uma lib genérica pra efeitos educacionais, tento não fazer bobagens. Em um dos testes que eu fiz, por exemplo, o uso de queues alocadas estaticamente invés de listas encadeadas fez o radixsort ganhar do quicksort. Pq?

Você acha que se um algoritmo tem complexidade de tempo O(n) e o outro é O(n*log(n)), ambos em caso médio, o algoritmo linear é necessariamente melhor que o log-linear? (exemplo: radixsort vs heapsort)

Tá, essa eu não sabia mesmo. Hoje descobri a origem do Radixsort e tem a ver com a ordenação de cartões perfurados (punch cards). Professor sacou um usado com 8x80 pontos, representando uma linha, contendo um byte pra cara char. O algoritmo de ordenação linear q n eh tão rápido.

修正を。RadixSortではなくRadixHeapでした。

O(N) でソートができるアルゴリズムといえば RadixSort !! みんなも実装しよう

RadixSort algorithm efficiently organizes numeric data by sorting from the least significant to the most significant digit. This approach works well for both integer and float data types. The time complexity of RadixSort is O(n * k), where 'n' is the number of elements and 'k' represents the maximum number of bytes in the elements. The method iterates over each byte position to sort the data accordingly. In conjunction with MQL, a highly-optimized LSD RadixSort implementation is available, leveraging radix 256 (8-bits). This version is capable of handling large arrays with millions of numbers efficiently. Stemming from Pierre Terdiman's work, it incorporates various optimizations for enhanced performance, attaining speeds of 3-10 times faster than MQL's native ArraySort() function. This implementation accepts arrays of different types but sorts them b... #MQL5 #MT5 #Algorithm #Sorting mql5.com/en/code/38763?utm_s…

hmm that's a very interesting comment yet, all that ingenuity leads you to a slower algorithm in terms of interactions. so, humans are good at designing algorithms for a machine that humans invented, which itself is a distortion of the optimal 🤔 that's kinda how I see it. like, the "quicksort" or "radixsort" or whatever is the sort function it finds - it is faster in terms of interactions, because it only passes through all constructors once. that's a very interesting (underestimated) property

RadixSort is the answer, you'll probably need to build a sorting key with those fields combined in that order. @Akgames01 shared a library with the implementation for Vulkan and Directx I believe.

עובדות מעניינות: - ניתן למיין מערך של n מספרים בזמן לינארי באמצעות אלגוריתם RadixSort אם כל המספרים בטווח n^c (כאשר c קבוע מסויים) - פונקציית אקרמן ההפוכה אמנם שואפת לאינסוף אבל בקצב מספיק איטי כדי שנתייחס אליה כקבוע בניתוח אסימפטוטי - אני בדיכאון קליני אני אכשל במבחן מחר

tem algoritmos com melhor complexidade, mas eles dependem do dados, radixsort, countingsort

Today's covered topics : #RadixSort & #CountSort. Really very efficient for small number of inputs. It is #day53 of #100DaysOfDSA challenge. Kunal's Playlist link : lnkd.in/gtwXVyMT #codingforacause #dsa #DSAwithKunal #consistency #LeetCode #coding #100daysofcode

On Day 89 of the #100DaysOfCode, I learned about: • Radix Sort Algorithm - Theory Code • Also, I solved some coding questions based on binary trees. #DSAWithKunal #Java #Sorting #coding #Questions #BinaryTrees #RadixSort

"🚀 Day 9: Explored advanced Node.js & Express topics, mastered Git commands, delved into IoT on edX, cracked a Leetcode hard problem creatively(41), and learned about Radix Sort. 🌟 #coding #learning #progress #NodeJS #ExpressJS #IoT #LeetCode #RadixSort"

EU QUERO QUE O QUICKSORT SE FODA QUE MERGESORT VA PRA CASA DO CARALHO QUE O BUBBLESORT COMA O CU DO TEU PAI QUE O RADIXSORT ME DE UMA MAMADA BEM GOSTOSA

#RadixSort Time Complexity >It has a time complexity of  O(d * (n b)) d is the number of digits n is the number of elements b is the base of the number system #Java #Sorting #InterviewQuestions #JavaProgramming #coding #100daysofcoding

#RadixSort Time Complexity >It has a time complexity of  O(d * (n b)) d is the number of digits n is the number of elements b is the base of the number system #Java #Sorting #InterviewQuestions #JavaProgramming #coding #100daysofcoding

#RadixSort >uses a stable sorting algorithm as a subroutine to sort the digits >works by sorting digits from the Least Significant Digit (LSD) to the Most Significant Digit (MSD) #Java #Sorting #InterviewQuestions #JavaProgramming #coding #100daysofcoding