Newbie > Newbie: Applying Algorithmic Design
This blog post will discuss some important considerations when designing your programs. Despite computers getting more powerful, it is up to us programmers to choose the most efficient way to solve the problem in front of us. Efficient programming will minimize the time necessary to achieve the desired tasks and make the best use of resources. To be efficient, we must fully understand the task required and the data structures we will be working with. The amount of memory, storage and type, CPU, and even time are all examples of resources. Some may be more costly based on their sparsity. A data structure is composed of the type of data and its structure or relationship to other data within itself. Primitives and non-primitives are sub-components of data structures. Examples of primitives are integer, real, character, and boolean. These define the data piece of the data structure. Some examples of non-primitive structures are linear and non-linear. Arrays, lists, stacks, and que...