Tree traversal

There are two types of traversals when we are talking about trees. You can get the notes about both from these links:

Breadth First Traversal

Depth First Traversal

Trees

Before we can study Heap Sort or any of the searching algorithms, we need to understand the concept of trees and how do we go about them.

We start our discussion from binary trees. You can get the linked list implementation of binary trees from here. Keep in mind that all the pointers in this implementation are not deallocated at the end of the program, which causes it to crash sometimes.

In order to see the results, what you can do is to put a break point just before the program finishes so that you can see the results shown by it. If time allows, I will try to fix this problem.

Radix sort

Radix Sort Algorithm

The notes for the course can be obtained here.

Psuedocode for algorithms

I am not following any book when it comes to algorithms or psuedocode.

a good resource is wikipedia to get the details about the algorithms, for example, the psuedocode for merge sort that i explained in the class is present here. You can use whatever resource you find is good for your understanding.

Till now, we have covered:

merge sort
insertion sort
selection sort and
bubble sort

Algorithm animations

A very good animation of all the sorting algorithms can be found here.

Algorithms and Complexity Analysis

A very good document about complexity analysis can be obtained from here. You must read it as it is very well written.

The slides for the first lecture are present here

Assignment 2

The assignment 2 can be obtained from here.