Back to Course
Algorithm
0% Complete
0/82 Steps

Getting Started with AlgorithmWhat is an Algorithm?

Characteristics of Algorithm1 Topic

Analysis Framework

Performance Analysis3 Topics

Mathematical Analysis2 Topics

Sorting AlgorithmSorting Algorithm10 Topics

Searching Algorithm6 Topics

Fundamental of Data StructuresStacks

Queues

Graphs

Trees

Sets

Dictionaries

Divide and ConquerGeneral Method

Binary Search

Recurrence Equation for Divide and Conquer

Finding the Maximum and Minimum

Merge Sort

Quick Sort

Stassenâ€™s Matrix Multiplication

Advantages and Disadvantages of Divide and Conquer

Decrease and ConquerInsertion Sort

Topological Sort

Greedy MethodGeneral Method

Coin Change Problem

Knapsack Problem

Job Sequencing with Deadlines

Minimum Cost Spanning Trees2 Topics

Single Source Shortest Paths1 Topic

Optimal Tree Problem1 Topic

Transform and Conquer Approach1 Topic

Dynamic ProgrammingGeneral Method with Examples

Multistage Graphs

Transitive Closure1 Topic

All Pairs Shortest Paths6 Topics

BacktrackingGeneral Method

NQueens Problem

Sum of Subsets problem

Graph Coloring

Hamiltonian Cycles

Branch and Bound2 Topics

0/1 Knapsack problem2 Topics

NPComplete and NPHard Problems1 Topic
In Progress
Lesson 4 of 43
In Progress
Performance Analysis
One goal of this course is to develop skills for making evaluative judgments about algorithms. There are many criteria upon which we can judge an algorithm. For instance:
1.Does it do what we want it to do?
2.Does it work correctly according to the original specifications of the task?
3.Is there documentation that describes how to use it and how it works
4.Are procedures created in such a way that they perform logical sub functions?
5.Is the code readable?
These criteria are all vitally important when it comes to writing software, most especially for large system.
There are other criteria for judging algorithms that have a more direct relationship to performance. These have to do with their computing time and storage requirement.