Algorithm essay

An algorithm is a finite list of instructions, most often used in solving problems or performing tasks. You may have heard the term used in some fancy context about a genius using an algorithm to do something highly complex, usually in programming. Indeed, you've most likely heard the term used to explain most things related to computer processes.

An approach by the greedy algorithm to ensure optimization is the maintaining of two sets one for chosen items and the other for rejected items. Based on the two sets the algorithm will carry out four functions. Function one checks whether the chosen set of items can provide a solution. Function two checks for flexibility of the set.

Hence, meaning that a linearly constructed algorithm will calculate the results faster on a computer with less processing power than on a state-of-the-art computing machine. The reason for this is the way the algorithm is constructed. If we have a linear base algorithm, it will use one thread of the CPU and calculate linearly.

The execution time of algorithms directly relates to the size of the input data and the complexity and efficiency of the algorithm itself. If we input more or bigger data, the sorting algorithms will take more time to give the results. In addition, if the algorithm is more complex, again, the results will calculate more slowly.