wait a sec i just realized this is sleep sort 5 min after i finished it oopsie Funny sorting algorithm I made with time complexity O(n * r) where r is the range of element values only works for number arrays too it works by finding the smallest element, setting a counter to that number, then it finds every other element with the value of that counter and inserts it at the beginning of the array. then, it increments the counter and finds every element with that value, and inserts it right after the previous sorted elements. this continues until it hits the largest element. so the time complexity is the length of the array * the range of the values. seems too good to be true so idk if its right but hopefully it is have fun trying to sort numbers like 100,000 lol
