I created a new sorting algorithm but its more like a "bubble sort" and "gnome sort" thing where its just an inneficient version of an existing sort, mine is with "counting sort" My sorting algorithm (counter sort): ``` python nums = [LIST HERE] sorted = [] num = min(nums) print(f"Your starting list is {nums}.") while True: while num in nums: sorted.append(num) nums.remove(num) if len(nums) == 0: print(f"Your new list is {sorted}.") break else: num += 1

















