input: Write a python function to sort a list such that all odd numbers appear before all even numbers, preserving their original relative order.
  assert memory_optimized_sort([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]) == [1, 3, 5, 7, 9, 2, 4, 6, 8, 10]
  assert memory_optimized_sort([10, 20, 45, 67, 84, 93]) == [45, 67, 93, 10, 20, 84]
  assert memory_optimized_sort([5, 7, 9, 8, 6, 4, 3]) == [5, 7, 9, 3, 8, 6, 4]
output: def memory_optimized_sort(lst):
      odds = [x for x in lst if x % 2 != 0]
      evens = [x for x in lst if x % 2 == 0]
      return odds + evens