Algorithmic Design And Data Structures
In computing, we desire to solve problems quickly. Put information in a database, and you replace the old way of going to a file cabinet, digging up the records, and looking for the relevant information on some piece of paper in the folder. We know computers can find this information much faster than a person rifling through the files, but that depends on the information being captured into the database in the first place. When we discuss algorithmic design, we look for a sufficiently efficient means of accomplishing the goal. If I need information from 10 files, sending Aunt Edna to the records storage center is a reasonable solution, and we can expect her to find an answer in an hour or two. But this assumes the records are stored in a way that allows her to quickly find them. If the files are stored alphabetically, she can narrow the search to just the cabinets with records for that name. If the records are stored by social security number, she can reference the ma...