Algorithmic Design and Data Structure Techniques

While developing a structured program, it is essential to understand the differences and importance of algorithm design and data structure techniques. Algorithms are instructions for manipulating the data, while a data structure is a way to organize data effectively (Algorithms design techniques, 2020).

When deciding what algorithms and data structures will be better, this ultimately depends on the analysis of your problem and the basic operations needed to support the execution. For example, designing a search feature for an application is highly beneficial to use a searching algorithm versus a sorting algorithm. When selecting a searching algorithm, there are many to choose from; for example, you can choose whether a linear or a binary search approach best meets your application's needs (Lysecky, 2015). Let's pose a situation where we create an application that needs to search a list of ice creams; because of the low complexity, I would choose a linear search. 

References: 

Algorithms design techniques. GeeksforGeeks. (2020, September 30). Retrieved March 31, 2022, from https://www.geeksforgeeks.org/algorithms-design-techniques/

 Lysecky, R., Vahid, F., Lysecky, S., & Givargis, T. (2015). Data structures essentials. Retrieved from https://zybooks.zyante.com/#/zybook/DataStructuresEssentialsR25/chapter/1/section/3 Shaffer, C. A. (2013). Data structures and algorithm analysis (3.2 ed.). Retrieved from http://people.cs.vt.edu/~shaffer/Book/JAVA3elatest.pdf