Sort by Removing Sort by Removing
Undefined
English

Your goal is to create the fastest sorting algorithm ever - Sort By Removing.

You just need to remove all elements from a given array that are in the incorrect order. As always, we have some conditions:

  • it's an asc sorting;
  • the first element should always stay in the result list;
  • the result of an empty list is an empty list;
  • the elements are always integers.

Input: A list of ints.

Output: A list of ints.

Example:

sort_by_removing([3, 5, 2, 6]) == [3, 5, 6]
sort_by_removing([7, 6, 5, 4, 3, 2, 1]) == [7]
sort_by_removing([3, 3, 3, 3]) == [3, 3, 3, 3]
sort_by_removing([5, 6, 7, 0, 7, 0, 10]) == [5, 6, 7, 7, 10]
sort_by_removing([1, 5, 2, 3, 4, 7, 8]) == [1, 5, 7, 8]