Skip available courses

Available courses

Course objectives and learning outcomes:
• Students will develop an understanding of sorting algorithms.
• Students will develop an understanding of basic sorting algorithms: bubble sort, selection sort, insertion sort.
• Students will develop an understanding of integer sorting algorithm: radix sort.
• Students will develop an understanding of advanced sorting algorithms: merge sort, heapsort, quick sort.
• Students will develop an understanding of algorithm design techniques: divide and conquer, greedy method, dynamic programming.
• Students will develop an understanding of graphs, graph traversals and graph algorithms.