This one about Algorithms
The next one is on Data Structures
Algorithm
- Define what an Algorithm is
- Why is it often possible to have more than one solution to a single problem?
- Give an example of where a sorting algorithm might be used in a real world computer application.
- Write a description of how the selection sort works.
- What is Big-O notation and what order is Selection Sort?
- Which is more efficient the selection sort or the merge sort?
- What is the complexity of a brute force search?
- What order of complexity of Dijkstra’s original Algorithm?
- Use the original Dijkstra's algorithm to find the shortest route from the node s to the node t in the diagram below. Show your working.