Assignment 1

Assignment 1 is ready ... checkout the "Assignments" tab.

Start early and do not hesitate to ask if you face any problems.

Enjoy!

Update: It seems that the E-Learning website at PSUT is down. I have added an alternative link just in case you are facing problems in downloading this assignment

Searching and Sorting

I have just uploaded a new version of the file "Searching and Sorting" in the "Course Material" tab. If you have already downloaded the file, then please delete the old version and re-download the new one again.

Visualizations of Sorting Algorithms

The following links contain interactive visualizations for sorting algorithms.

http://math.hws.edu/TMCM/java/xSortLab/

http://visualgo.net/sorting.html

Visualgo.net contains many excellent visualizations for many data structures and algorithms that we cover in the course. It is worth going back to this website every time we cover a new data structure or algorithm.

Have fun playing :)

Asymptotic Analysis Slides

I have just uploaded the Big-O slides. You can find them in the "Course Material" tab.

Asymptotic Analysis of Algorithms

Here is a good-short-informal summary of the asymptotic analysis of algorithms.

At the end of the video Big-Theta and Big-Omega are mentioned, which we do not cover in this course. More about them in the "Design and Analysis of Algorithms" course inshaAllah.

What is an Algorithm?

A short video that explains informally what an algorithm is and how to compare between algorithms.

As we have said in class, we should ask ourselves three questions whenever we design any algorithm:

• How quick is the algorithm?
• How much space does it require?
• Is it correct?

Our concentration in this course is on the basics of answering the first question ... just to the level that allows us to understand which operations are faster on which data structures!