  
  class TestQuickSort(object):
      def test_quick_sort(self, func):
          print('None input')
          data = None
          sorted_data = func(data)
          assert_equal(sorted_data, None)
  
          print('Empty input')
          data = []
          sorted_data = func(data)
          assert_equal(sorted_data, [])
 
</s> remove     def test_quick_sort(self, func):
 </s> add     def test_quick_sort(self):
        quick_sort = QuickSort()
 </s> remove         data = []
        sorted_data = func(data)
        assert_equal(sorted_data, [])
 </s> add         assert_equal(quick_sort.sort([]), []) </s> remove         data = [5]
        sorted_data = func(data)
        assert_equal(sorted_data, [5])
 </s> add         assert_equal(quick_sort.sort([5]), [5]) </s> remove from nose.tools import assert_equal
 </s> add from nose.tools import assert_equal, assert_raises </s> remove     "        data = None\n",
    "        sorted_data = func(data)\n",
    "        assert_equal(sorted_data, None)\n",
 </s> add     "        assert_raises(TypeError, quick_sort.sort, None)\n",
        assert_raises(TypeError, quick_sort.sort, None)
  
  class TestQuickSort(object):
      def test_quick_sort(self, func):
          print('None input')
        assert_raises(TypeError, quick_sort.sort, None)
        assert_raises(TypeError, quick_sort.sort, None)
        assert_raises(TypeError, quick_sort.sort, None)
  
          print('Empty input')
          data = []
          sorted_data = func(data)
          assert_equal(sorted_data, [])
keep keep keep keep replace replace replace keep keep keep keep keep
 Update quicksort challenge (#134)

Update constraints, test cases, code, algorithm, and tests. 
sorting_searching/quick_sort/test_quick_sort.py