  
          print('Test: Two or more element stack (general case)')
          num_items = 10
          numbers = [randint(0, 10) for x in range(num_items)]
          sorted_stack = self.get_sorted_stack(numbers)
          sorted_numbers = []
          for _ in range(num_items):
              sorted_numbers.append(sorted_stack.pop())
          assert_equal(sorted_numbers, sorted(numbers, reverse=True))
  
 
</s> remove         sorted_stack = self.get_sorted_stack([1])
 </s> add         sorted_stack = self.get_sorted_stack(stack, [1]) </s> remove     "        sorted_stack = self.get_sorted_stack(numbers)\n",
 </s> add     "        sorted_stack = self.get_sorted_stack(stack, numbers)\n", </s> remove     "        sorted_stack = self.get_sorted_stack(numbers)\n",
 </s> add     "        sorted_stack = self.get_sorted_stack(stack, numbers)\n", </s> remove     "        sorted_stack = self.get_sorted_stack([1])\n",
 </s> add     "        sorted_stack = self.get_sorted_stack(stack, [1])\n", </s> remove     "        sorted_stack = self.get_sorted_stack([1])\n",
 </s> add     "        sorted_stack = self.get_sorted_stack(stack, [1])\n",
        sorted_stack = self.get_sorted_stack(stack, numbers)
  
          print('Test: Two or more element stack (general case)')
          num_items = 10
          numbers = [randint(0, 10) for x in range(num_items)]
        sorted_stack = self.get_sorted_stack(stack, numbers)
          sorted_numbers = []
          for _ in range(num_items):
              sorted_numbers.append(sorted_stack.pop())
          assert_equal(sorted_numbers, sorted(numbers, reverse=True))
  
keep keep keep keep replace keep keep keep keep keep
 Add intermediate sort stack solution and test 
stacks_queues/sort_stack/test_sort_stack.py