          sorted_stack = self.get_sorted_stack([])
          assert_equal(sorted_stack.pop(), None)
  
          print('Test: One element stack')
          sorted_stack = self.get_sorted_stack([1])
          assert_equal(sorted_stack.pop(), 1)
  
          print('Test: Two or more element stack (general case)')
          num_items = 10
          numbers = [randint(0, 10) for x in range(num_items)]
 
</s> remove         sorted_stack = self.get_sorted_stack(numbers)
 </s> add         sorted_stack = self.get_sorted_stack(stack, numbers) </s> remove         sorted_stack = self.get_sorted_stack([])
 </s> add         sorted_stack = self.get_sorted_stack(stack, []) </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", </s> remove     def test_sort_stack(self):
 </s> add     def test_sort_stack(self, stack):
        sorted_stack = self.get_sorted_stack(stack, [1])
          sorted_stack = self.get_sorted_stack([])
          assert_equal(sorted_stack.pop(), None)
  
          print('Test: One element stack')
        sorted_stack = self.get_sorted_stack(stack, [1])
          assert_equal(sorted_stack.pop(), 1)
  
          print('Test: Two or more element stack (general case)')
          num_items = 10
          numbers = [randint(0, 10) for x in range(num_items)]
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