class SortingAlgorithmsTestCase(unittest.TestCase):
def setUp(self):
self.desor1 = [66, 71, 16, 21, 79, 9, 40, 60, 5]
self.or1 = [5, 9, 16, 21, 40, 60, 66, 71, 79]
self.desor2 = [66, 71, 16, -21, 79, 9, 40, 60, -5]
self.or2 = [-21, -5, 9, 16, 40, 60, 66, 71, 79]
self.desor3 = [5, 9, 16, 21, 40, 60, 66, 71, 79]
self.or3 = [5, 9, 16, 21, 40, 60, 66, 71, 79]
self.Sort = Sort()
def testBuble(self):
self.assertEqual(self.Sort.BubleSort(self.desor1), self.or1)
def testInsertion(self):
self.assertEqual(self.Sort.InsertionSort(self.desor1), self.or1)
def testMerge(self):
self.assertEqual(self.Sort.MergeSort(self.desor1), self.or1)
def testBubleNegativo(self):
self.assertEqual(self.Sort.BubleSort(self.desor1), self.or1)
def testInsertionNegativo(self):
self.assertEqual(self.Sort.InsertionSort(self.desor1), self.or1)
def testMergeNegativo(self):
self.assertEqual(self.Sort.MergeSort(self.desor1), self.or1)
def testBubleOrdenado(self):
self.assertEqual(self.Sort.BubleSort(self.desor1), self.or1)
def testInsertionOrdenado(self):
self.assertEqual(self.Sort.InsertionSort(self.desor1), self.or1)
def testMergeOrdenado(self):
self.assertEqual(self.Sort.MergeSort(self.desor1), self.or1)
def test_insertion_3(self):
insertion = Sort()
listaDesordenada = [-2, -5, -99, 1, 5, 3, 1, 8, 1, -5]
listaOrdenada = insertion.InsertionSort(listaDesordenada)
self.assertEqual(listaOrdenada, [-99, -5, -5, -2, 1, 1, 1, 3, 5, 8])
def test_insertion_2(self):
insertion = Sort()
listaDesordenada = [0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
listaOrdenada = insertion.InsertionSort(listaDesordenada)
self.assertEqual(listaOrdenada, [0, 1, 1, 1, 1, 1, 1, 1, 1, 1])
def test_insertion_1(self):
insertion = Sort(
) #clase que va a recibir cada uno de los ingresos,define el estado inicial
listaDesordenada = [36, 71, 16, 21, 73, 9, 0, 40, 66, 5]
listaOrdenada = insertion.InsertionSort(listaDesordenada)
self.assertEqual(listaOrdenada, [0, 5, 9, 16, 21, 36, 40, 66, 71, 73])
def test_insertion_1(self):
insertion = Sort()
listaDesordenada = [36, 71, 16, 21, 73, 9, 0, 40, 66, 5]
listaOrdenada = insertion.InsertionSort(listaDesordenada)
self.assertEqual(listaOrdenada, [0, 5, 9, 16, 21, 36, 40, 66, 71, 73])
def test_Insertion_3(self):
insertion = Sort()
listaDesordenada = [1, 2, 3, 4, 5]
listaOrdenada = insertion.InsertionSort(listaDesordenada)
self.assertEqual(listaOrdenada, [1, 2, 3, 4, 5])
def test_Insertion_2(self):
insertion = Sort()
listaDesordenada = [1, -2, 3, -4, 5]
listaOrdenada = insertion.InsertionSort(listaDesordenada)
self.assertEqual(listaOrdenada, [-4, -2, 1, 3, 5])
