Ranter
Join devRant
Do all the things like
++ or -- rants, post your own rants, comment on others' rants and build your customized dev avatar
Sign Up
Pipeless API
From the creators of devRant, Pipeless lets you power real-time personalized recommendations and activity feeds using a simple API
Learn More
Comments
-
My favorite sorting algorithm is Radix LSD (least common denominator) base 10.
It’s actually really fucking sick. -
Root825574y@OmerFlame Radix sort is also my favorite βΊοΈ
But why base 10? Ease of explaining the implementation? -
yeah, reinventing the wheels and later realizing that you did that is cool. it's like a small confirmation that "yeah, i'm on the right track" :)
-
My fav is Shellsort: in-place, no recursion, and faster than Quicksort for lists of a few dozens in length.
-
I used modulus 7 in the real world yesterday and I felt similarly like a badass.
-
It’s good to start at an early age, if I knew you could use programming to develop games I would’ve gladly started out as a kid...then again I would’ve created something retarded like super penisio bros
-
@d-fanelli exactly, I had seen things in movies but the idea of writing software did not cross my mind. Now, i was in 2002 at the time, computers were different than what they got early, I didanage to play with a commodore 64 that my uncles had, but I still did not get it :P things were different and if Root was a teenager in the 80s it would make sense to believe that she had to program them. But I am assuming too much
-
neeno31724yHoly shit, 11yo and already thinking about performance and sorting algorithms. When I was 11 all I could do was play around in visual basic, I don't think I even knew what arrays were.
-
For me the computer was the cheat code generating wizard of oz using the magic of the dial up Internet. I knew where to go when I needed mortal Kombat fatalities or cheat codes for crash bandicoot
-
@Root no, it’s just really fucking mesmerizing to see it visualized and it sounds fucking SICK when you attach sound to it. There is a project called “Sound Of Sorting”, and it does just that. And it has Radix π
-
FWIW having very limiting constraints is basically how most algos with nice complexity metrics get made.
Related Rants
When I was in 7th grade, my neighbor (a DoD programmer) challenged me to write a sorting algorithm for a hypothetical super limited environment (he said a satellite). It didn’t have any built-in sorting methods, had very limited memory, slow processor, etc. so I needed to be clever about it.
It took me a few nights before i found a solution he liked. The method I came up with counted the number of occurrences of each number in the array and put them in the appropriate spots in a new array. This way it only required O(2n) running time and 2n memory.
I just learned today that this is called the “counting sort” π
I’m proud of little 11 year old me.
random
sorting
root remembers her childhood
and itβs something good this time!
childhood