Algorithmic Design and Data Structure Techniques

How would you apply algorithmic design and data structure techniques? Are some better than others? How would you apply them? 

    In order to fully see how items work together, it is key to break down each section and define them. When it comes to algorithmic design, this can be seen as the process to create and design algorithms/functions to solve situations that may occur or just construct the way that certain tasks can be done. The next key term to know is data structure techniques. These techniques are used to store data and also organize it. Some examples of this can be arrays, stacks, queues, lists, tree maps, and more.

With there being different ways of completing certain tasks, there will be better techniques in order to complete them. But this all comes down to what the task or problem is at hand. For example, if the order in which task is complete matter, then using a sorted array or even a tree would be the better choice. Or what if the choice is to search for an element, then using a searching or sorting function based on element size would need to be considered. To further explain, if the code required you to search a small amount of data for an item. You could use a Linear Search. According to Lysecky et al, “Linear search is a search algorithm that starts from the beginning of a list, and checks each element until the search key is found or the end of the list is reached” (2015). Overall, the programmer would need to figure out what is needed for their program. They will need to ensure that their objectives are being met in the most beneficial way. 

References: 

Lysecky, R., Vahid, F., Lysecky, S., & Givargis, T. (2015). Data structures essentials. zyBooks