Python min_heap_sort Beispiele

Beispiel #1

    def test_heap_sort(self):
        self.assertTrue(
            is_sorted(max_heap_sort([1, 3, 2, 5, 65, 23, 57, 1232])))

        self.assertTrue(
            is_sorted(min_heap_sort([1, 3, 2, 5, 65, 23, 57, 1232])))

Beispiel #2

 def test_heap_sort(self):
     self.assertEqual([1, 5, 23, 57, 65, 1232],
                      max_heap_sort([1, 5, 65, 23, 57, 1232]))
     self.assertEqual([1, 5, 23, 57, 65, 1232],
                      min_heap_sort([1, 5, 65, 23, 57, 1232]))

Beispiel #3

Datei: test_sort.py Projekt: Danawill/algorithms

 def test_heap_sort(self):
     self.assertEqual([1, 5, 23, 57, 65, 1232],
                      max_heap_sort([1, 5, 65, 23, 57, 1232]))
     self.assertEqual([1, 5, 23, 57, 65, 1232],
                      min_heap_sort([1, 5, 65, 23, 57, 1232]))