https://parametricavocado.itch.io/amen-sorting #sortingalgorithms #AmenBreak #musicalgenius #bubbleSort #HackerNews #HackerNews #ngated
Full code on Github: https://github.com/wiwa/blog-code/ Hi Link to heading Recently, I finished a batch at the Recurse Center… is what I would have said if this post were written when I intended to write it (i.e. 3 months ago). My project there focused on a questionable application of CUDA (mostly irrelevant to this post), but it got me thinking more about other GPU-friendly algorithms. Instead of my Recurse project (which I hope to write about in a later post), I want to simply begin writing about technical stuff I’ve played around with.
🚀 Exciting news! I've just launched my new blog dedicated to all things IT! 📚🔧
Dive into my latest articles where I break down sorting algorithms like bubble, insertion, and selection sort. Join me on this tech journey and stay tuned for more! 💻✨
This is very cool. A #Hungarian #dance group dances #sorting #algorithms.
#sort #sortingalgorithms #compsci #computerscience
H/t @ct_Magazin
#AI #AIAlgorithms #Algorithms #DeepMind #AlphaDev #ComputerScience #SortingAlgorithms: "DeepMind published its results in Nature today. But the techniques that AlphaDev discovered are already being used by millions of software developers. In January 2022, DeepMind submitted its new sorting algorithms to the organization that manages C++, one of the most popular programming languages in the world, and after two months of rigorous independent vetting, AlphaDev’s algorithms were added to the language. This was the first change to C++’s sorting algorithms in more than a decade and the first update ever to involve an algorithm discovered using AI.
DeepMind added its other new algorithms to Abseil, an open-source collection of prewritten C++ algorithms that can be used by anybody coding with C++. These cryptography algorithms compute numbers called hashes that can be used as unique IDs for any kind of data. DeepMind estimates that its new algorithms are now being used trillions of times a day."
Sorting Algorithms might be an old hat for computer scientists, but running times on the fastest of these algorithms is usually O(Nlog(N)) on a single core. I thought, with an FPGA, why not try a parallel approach in hardware to bring the running time down to O(N)? A few head-scratching evenings later–behold–the Linear-Time-Sorter was born! I’m jazzed to mock this up as an SPI-peripheral for a microcontroller. Feel free to make use of the source files as you need.