labs of algorithms

algorithms and codes recorded

---

Sorting.cpp

Comparison between merge sort and quick sort, particularly the difference of their swapping time and running time sorting method should be clearly known

---

tug-of-war.cpp

Dynamic Programming

Given the problem of how to balance the weight and number of two teams when having tug of war.

---

sudoku.cpp

backtracking

Solve the puzzle of Sudoku

---

heapsort-insertionsort.py

sorting 2nd

iterative insertion sort compare two insertions by generating random array which is large enough then we know if n>20 heap sort is better

---

ranking.py

divide and conquer

merge two rankings into overall ranking

---

alignment.py

dynamic programming

find the longest alignment of two sequence