Algorithmic design and data structure techniques in developing structured programs.
Algorithmic design & Data Structure techniques What are Algorithms? An algorithm is a sequence of steps for accomplishing a task. (Lysecky, 2005), in other words, an algorithm is a step-by-step instruction to solve a specific problem. For instance, the recipe for making a cake is an example of an algorithm and the goal to make a cake following the step-by-step recipe. Search algorithm. Linear Search. It starts at 1 and goes up by 1 each time until it finds the desired data. It became inefficient on large data, which is not optimal for a computer algorithm. Binary Search. It is to find the position of the specific element in a sorted list. It is sorted through a list of things. Just remember that it only works in a sorted list. Depth-First search (DFS), the idea is to start at the root node, and go down one branch as possible, all the way to the end. Once we hit the deepest point, which is the “depth” part of the DFS comes from, w...