Techniques to Develop Structured Programs
In order for written computer programs to perform tasks, there must be a suitably constructed algorithm. Furthermore, the common tasks can be divided into sorting and searching, sorting is the ordering of listed values whilst searching is described as finding the position of a value in a list. An algorithm in its essence is a limited sequence of particular directions for computational performance in order to solve a problem. Sorting, in particular, is efficient for its use in programming - being able to find and locate items in a sorted list rather than having to go through a tedious search process. One algorithm is selection sort where the smallest element is found and moved to the front, swapping with the front element. Another sorting algorithm is bubble sort , where it starts at the beginning of the list and swaps the first two elements if the first is bigger than the second and continues this pattern for the next pair and so on until the list is sorted. The...
