Question: Given a list in python, what is an algorithm that can sort it in O(n) time. You can assume the list only has '0' and
Given a list in python, what is an algorithm that can sort it in O(n) time.
You can assume the list only has '0' and '1' integers.
[0, 1, 0] --> [0, 0, 1]
[1, 1, 0, 0, 0] --> [0, 0, 0, 1, 1]
[0, 1] --> [0, 1]
You can assume the list has two elements at a minimum. Please implement is as a function thesortalgorithm(list)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
