Algorithm for solving problems
Properties of algorithms
An algorithm is a procedure that enables the PC to solve problems. It involves successive unambiguous instructions. The same algorithm is executed again and again in exactly the same way. Algorithms are thus unambiguous instructions for solving a problem or a class of problems. To write computer programmes, we have to explain to the computer step by step what it has to do. We can choose exactly how it should proceed. Software programmes help with this.
Examples of algorithms
A lot of research has been done on sorting because computers spend a lot of time sorting lists. Different algorithms for sorting are: Bubble sort, Quicksort, Shell sort, Merge sort and Bin sort/Bucket sort. When sorting whole values from 1 to 10, it is best to use Bin Sort. For countless book titles, Quicksort may be the best way.
Search engine algorithms take as input search strings with keywords and operators, search the relevant database for relevant websites and return the appropriate results.
Encryption algorithms transform data for protection according to specific actions. A secret key algorithm uses the same key to encrypt as well as decrypt data. As long as these algorithms are sufficiently sophisticated, the data cannot be deciphered by anyone without a key.
