The wonky skittle problem 🫠

The wonky skittle problem 🫠 #compsci #coding #fyp

[Tomohiko_Tatsuno]

Bad metaphor because i guarantee that took longer even with the cuts than it would have taken me to sort it 🤣

[rishterm]

Thats not fair youre able to move skittles by snapping

[arbitrario]

Mergesort's worst case isnt o(logn) its o(nlogn)

[alastairtut]

Using bigO notation and explaining what problem size this method is efficient with would make this a lot better

[liamberney]

Bucket sort is way faster in this example

[totheth]

Pigeon hole sort is O(n), Merge Sort is O(nlogn). For n >= e, n <= n log n, because log n is above 1

[JustAHat]

even with the cuts thats way slower than just sorting them normally

[SajjaadKhader]

Disclaimer: usually u break it down to subarrays of 1 and then sort as ur merging. I changed it up slightly for the visual demo

[tacomiester]

Why didn’t u just snap once to sort the whole thing you’re clearly magical

[GrouseMan]

Nah i could do this in 5 seconds no cuts