ITS003 DATA STRUCTURE AND ALGORITHM
Lecture and HomeWork Solution
ITS003 Lecture 1
introduce to Algorithm, Defining Algorithm, Data Structure, Algorithm efficiency, Running time, Sort, Pseudo Code!!!,
Insertion Sort, Python, Algorithm Analysis, Worst Case.
--------------------------------------------------------------
ITS003 Lecture 2
Growth of Function, Insertion VS Bubble, Worse or Average case, Asymtronic Rate, Asymtronic, Big-O, Big-Omega, Big-Theta,
Mergesort, Divide and Conquer, Analysis Merge Sort, Time Complexity
------------------------------------------------------------------
ITS003 Lecture 3
------------------------------------------------------------------
ITS003 Lecture 4 Heap Sort
------------------------------------------------------------------
ITS003 Lecture 5 Quick Sort
------------------------------------------------------------------
ITS003 Lecture 6 Quick Sort and Sorting in O(n)
------------------------------------------------------------------
ITS003 Lecture 7 Binary Search, Select Order and Hash.
------------------------------------------------------------------
ITS003 Lecture 8 Dynamic Program <----- Cool !!!
------------------------------------------------------------------
ITS003 Lecture 9 Greedy algorithm
------------------------------------------------------------------
ITS003 Lecture 10 Graph
------------------------------------------------------------------
HW2 SOlution
------------------------------------------------------------------
Click link with right mouse, then select "Save Target As"
Last Update 1:28 24/2/2548