How to apply Algorithmic Design and Data Structure Techniques in Structured Programs

 What is an Algorithm, and how do you apply it?

An algorithm is considered a step-by-step procedure that has instructions designed to complete a certain command to receive an output. 

There are a few important categories of Algorithms, which are delete, update, sort, insert, and search.

How to apply it?

In order to apply these techniques to structured programs, we need to be able to first understand the issue and be able to define all the outputs and inputs. We should then choose something appropriate to arrange the data in, such as arrays, trees, or lists. 

This step to identify which data style we need to use is essential because some data structures may hold less data than others. Some methods can give a more detailed output compared to others.

Making sure we know what data we have and understanding the outcomes each Data structure provides is really important to apply to any structured program. 

What is a Tree data structure?

This data structure is considered "hierarchical" as it has a root, node, and parent and child notes.

What is an Array data structure?

When using an array, you normally have a fixed amount of data you're using in the code. Ex. {1,3,6,7,0}

What is a list data structure?

In a list data structure, there will be multiple stuff to add to your code. 

References:

1.1. Data Structures and Algorithms — CS2 Software Design & Data Structures. (n.d.). https://opendsa-server.cs.vt.edu/ODSA/Books/CS2/html/IntroDSA.html

GeeksforGeeks. (2023, February 15). Algorithms design techniques. https://www.geeksforgeeks.org/algorithms-design-techniques/