This is the example class project for SC2001 Algorithm Design & Analysis. We are Group 7 from Tutorial Group SCSA.

Project Description

Here is the general description of the project.

Project 1: Integration of Mergesort & Insertion Sort

We present a hybrid sorting algorithm that combines mergesort and insertion sort. Then we compare the performance with different implementations.

• problems: pdf
• codes: algo, data, analysis
• slides: pdf, pptx

Project 2: The Dijkstra’s Algorithm

We implement the Dijkstra algorithm with heap and array. Then we compare the performance with different implementations.

• problems: pdf
• codes: algo, data & analysis
• slides: pdf, pptx

Project 3: Dynamic Programming

We design a dynamic programming algorithm to solve the knapsack problem. Then we compare the performance with different implementations.

• problems: pdf
• codes: algo
• slides: pdf, pptx

Team Members

Name	Email
Pu Fanyi	[email protected]
Qian Jianheng Oscar	[email protected]
Pushparajan Roshini	[email protected]
Rhea Susan George	[email protected]