Algorithm

Definition 1:

“An algorithm (pronounced AL-go-rith-um) is a procedure or formula for solving a problem, based on conducting a sequence of specified actions. A computer program can be viewed as an elaborate algorithm. In mathematics and computer science, an algorithm usually means a small procedure that solves a recurrent problem.” Source =http://whatis.techtarget.com/definition/algorithm

Historical background

“ Etymologically, the word ‘algorithm’ is a combination of the Latin word algorismus, named after Al-Khwarizmi, a 9th-century Persian mathematician, and the Greek word arithmos, i.e. αριθμός, meaning “number”. In English, it was first used in about 1230 and then by Chaucer in 1391. English adopted the French term, but it wasn’t until the late 19th century that “algorithm” took on the meaning that it has in modern English.

Another early use of the word is from 1240, in a manual titled Carmen de Algorismo composed by Alexandre de Villedieu. It begins thus:

Haec algorismus ars praesens dicitur, in qua / Talibus Indorum fruimur bis quinque figuris.

which translates as:

Algorism is the art by which at present we use those Indian figures, which number two times five.

The poem is a few hundred lines long and summarizes the art of calculating with the new style of Indian dice, or Talibus Indorum, or Hindu numerals.” Source = “https://en.wikipedia.org/wiki/Algorithm”

What I think Algorithm is?

When facing to a problem think of that problem as a large harvest, hence you can’t move entire harvest at once. You can only move by doing it by sequence and splits. So Algorithm in my Idea is to take a problem and split in small parts and start solving it part by part.

This is how I solve problems.

In plan section I do follow Algorithm.

Algorithm in Computer Science

Binary search

Learn about binary search, a way to efficiently search an array of items by halving the search space each time. Read More

Asymptotic notation

Learn how to use asymptotic analysis to describe the efficiency of an algorithm, and how to use asymptotic notation (Big O, Big-Theta, and Big-Omega) to more precisely describe the efficiency. Read More

Selection sort

Learn selection sort, a simple algorithm for sorting an array of values, and see why it isn’t the most efficient algorithm. Read More

click on image for A clear example in gif below Insertion sort

Learn insertion sort, another simple but not very efficient way to sort an array of values. Read More

click on the clear example of Insertion sort in GIF Below Merge sort

Learn merge sort, a more efficient sorting algorithm that relies heavily on the power of recursion to repeatedly sort and merge sub-arrays. Read More

click on the clear example of Merge Sort in GIF Below 