Newbie to Newbie Blog Part Two
Welcome back to my blog. In this post, I will explain in “newbie” terms how to apply algorithmic design and data structures techniques in developing structured programs. Also, I will try to explain why some algorithms and data structure designs are better than others. In addition, you will see an example of why one design is used before another design is used. An algorithm is a well-defined set of rules to solve problems. These computational problems can be anywhere from re-arranging numbers in a specific order, from smallest to biggest, or solving mathematical problems. Data structure offers services such as data organization, retrieval, and storage. Algorithms help with data processing and doing calculations to solve problems. Many structures, such as Arrays, Stacks, Linked Lists, and Tree, serve different purposes. These data structures construct, arrange, and configure data differently, such as in linear order for a linked list or in an abstract hierarchical way lik
