Assignment 1 is ready! Check the assignments tab.
Enjoy!
Enjoy!
Thursday, October 31, 2013
Sunday, October 20, 2013
Asymptotic Analysis
Eid Mubrark every one~!
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.
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.
Wednesday, October 9, 2013
A Change in Office Hours (Dr. Ibrahim)
Due to the changes in my course schedule, I have changed the office hours to be:
Su, Tu, Th: 10:00-12:00
Sunday, October 6, 2013
What is an Algorithm?
A short video that explains informally what an algorithm is and how to compare between algorithms.
For any algorithm that we design, we should ask ourselves three questions:
In this course, we will concentrate mainly on the basics of answering the first question. The course "Design and Analysis of Algorithms" may go deeper in answering all the three questions.
For any algorithm that we design, we should ask ourselves three questions:
- How quick is the algorithm?
- How much space does it require?
- Is it correct?
In this course, we will concentrate mainly on the basics of answering the first question. The course "Design and Analysis of Algorithms" may go deeper in answering all the three questions.
Subscribe to:
Posts (Atom)