All videoclips are captured
during fall semester of 2011 when the course was taught in
English.
Learning outcomes:
Student knows the basic definitions of the field and the
following methods: linear search, binary search, hashtables,
insertion sort, binary insertion sort, quicksort, merge sort,
counting sort, radix sort, bucket sort, heapsort
Student is able to compare different methods (time
complexity, space complexity, stability, implementation cost)
Student is able to implement a given method
Video (194 min)
Video
1 - Searching, introduction to sorting, general slow
sorting methods Video
2 - Sorting methods - quick sorting methods, special
methods Video
3 - Heapsort
Lecture
Notes
Lecture - Searching and sorting methods (in Estonian:
otsimis- ja järjestamismeetodid)
