Using algorithmic design and data-structure techniques in structured programming 101
As I begin this blog, I realize I’m still a newcomer to algorithms and data structures. Every computer depends on these fundamentals, and understanding them helps you determine what a system needs. Before you start designing, you must choose an appropriate data structure and a suitable algorithm. Data structures are ways to organize and store information in a computer so operations can be done efficiently. Common examples include: Arrays: collections of same-type items stored in consecutive memory locations. Linked lists: sequences of items connected in a linear chain. Stacks: last-in, first-out (LIFO) structures where the most recently added item is removed first. An algorithm is a defined procedure or set of rules for a computer to perform calculations or solve problems. Frequent algorithm design strategies include divide and conquer, approached from both top-down and bottom-up perspectives. Top-down design decomposes a problem into smaller modules. ...
