Sorting Information
Data profoundly influences the algorithms that perform a given task. Sorting is also a good example to show that such a task may be performed according to many different algorithms, each one having certain advantages and disadvantages that have to be weighted against each other in the light of the particular application.
Sorting is generally understood to be the process of re-arranging a given set of objects in a specific order. The purpose of sorting is to facilitate the later search for members of the sorted set. As such is an almost universally performed, fundamental activity. Objects are sorted in telephone books, in income tax files, in tables of contents, in libraries, in dictionaries, in warehouses, and almost everywhere that stored objects have to be searched and retrieved. Even small children are taught to put their things “in order”, and they are confronted with some sort of sorting long before they learn anything about arithmetic.
Hence sorting is a relevant and essential activity, particularly in data processing. What else would be easier to sort than “data”! Nevertheless, our primary interest in sorting is devoted to the even more fundamental techniques used in the construction of algorithms. There are not many techniques that do not occur somewhere in connection with sorting algorithms. In particular, sorting is an ideal subject to demonstrate a great diversity of algorithms, all having the same purpose, many of them being optimal in some sense, and most of them having advantages over others. It is therefore an ideal subject to demonstrate the necessity of performance analysis of algorithms. The example of sorting is more ever well suited for showing how a very significant gain in performance may be obtained by the development of sophisticated algorithms when obvious methods are readily available.
The dependence of the choice if an algorithm on the structure of the data to be processed- a ubiquitous phenomenon – is so profound in the case of sorting that sorting methods are generally classified into two categories, namely, sorting of arrays and sorting of (sequential) files.
Quick Note: Taking the Nonsense out of looking for the right spyware remover
If you really want to take the work out of looking for that right Spyware Protection from a Spybot go to the Internet and get a Free Spybot or a Free Spybot Search and Destroy
Download, In order to prevent your vital information from being ripped from your computer get your Spybot Remover Today.
The tow classes are often called internal and external sorting because arrays are stored in the fast, high-speed random access “internal” store of computers and files are conveniently located on the slower, but more spacious “external” stores based on mechanically moving devices (disks and tapes). Concept of sorting originated to simplify tasks which were cumbersome and very hard to distinguish
You really want to take the work out of looking for Protection from a lurking theif then you should get your free Spybot to protect you. Go to the Internet and get The New Spybot Search And Destroy Download or just Spybot
to prevent your vital information from being taken from you and given to someone who will steal your money or something else that you treasure so dearly.
Article Source: ArticlesBase.com - Sorting Information