Can we sort elements without comparing them? (Counting sort) - Inside code

Source code: gist.github.com/syphh/2ce8ef5...
🔴 Learn graph theory algorithms: inscod.com/graphalgo
⚙ Learn dynamic programming: inscod.com/dp_course
💡 Learn to solve popular coding interview problems: inscod.com/50problems_course
⌛ Learn time and space complexity analysis: inscod.com/complexity_course
🔁 Learn recursion: inscod.com/recursion_course
NB: This video is ad-free, you can choose to support Inside code by purchasing one of the courses above or dropping a super thanks!
NB2: Discounts of courses above are permanent
I also post content on LinkedIn (inscod.com/linkedin) and Instagram (inscod.com/instagram)

[@TheDarkOne629]

In uni, we got the assignment to find the best sorting algorithm to sort a million elements. At first I thought it was counting sort and it did well up to half a million elements but after that it became way too slow. Same for radix sort, which worked well for most students. The one that did it for me was pigeonhole sort. (The highest number of values I tested was 100 million) Interesting little story I hope. :P

[@insidecode]

It depends on properties of those elements, and thanks for the story

[@Ninvus2]

Doesn't the max() and min() function involve comparing all values in the array?

[@jsjnumbers6389]

I have only taken an introduction to computer logic, and have not learned any language yet in particular, so I know I can translate every one of these commands to any language using the corresponding syntax, so my question is, whether this is your version of pseudo code or is this actual syntax for a particular language and if so, what language.

[@insidecode]

Yes I used a real programming language: Python

[@hyper0505]

what if we want to get the median of some data with counting sort by using the count array,not the arr? can we possibly do that? i was figuring it out....

[@ctcrnitv]

00:10 this seems to me like a misleading visualization of insertion sort because it shows a swap being done on each iteration. As far as I know, the implementation involves storing the first unsorted element in a temp, copying the greater values in the unsorted half to the right, and only as a final step is putting the temp value back into the array.

[@insidecode]

Yes that's another possible implementation, both work

[@RandomGeometryDashStuff]

How does it get min and max without comparing?

[@insidecode]

What we're doing here is that we're kinda putting our elements on a long x-axis, for example if we have 12 we put it in x=12. After doing so, the leftmost element in the axis is the minimum and the rightmost element is the maximum

[@RandomGeometryDashStuff]

@@insidecode 04:17 getting minimum does use comparison

[@insidecode]

No you just start from the left and the first element that you find is the minimum

[@parthmakode5255]

i appreciate the effort but i stil didnt get it can you use a different voiceover for it please

[@insidecode]

Can you tell me what part you didn't get, I'll try to explain it here

[@paulotcj]

If you could speak without a sock in your mouth that would be great. Also, it's noticeable you are not comfortable explaining this. Learn the algo properly, then once you are confident, explain it. You did try to go way too fast in the part you don't know much about it.

[@insidecode]

Thanks for feedback! Can you briefly check recent videos and tell me if sound quality/explanation improved?