Definition of algorithm

In this work we are going to talk about the concept of "algorithm".
In class we have been watching some videos and discussing about what an algorithm is and how it works.
For this work, we have to follow some post requirements that are listed on Google Classroom by our teacher.
First we have to create a short introduction, then we have to find and explain one algorithm that resembles with the last work that we have done, V Neumann Architecture or Turing Machines, after this we have to create a Mindmap explaining the concept of algorithm and finally insert text and images to complete the exercise.

Here we can see two examples, that resembles the V Neumann architecture or the Turing Machine.

Merge Sort.

In computer science, merge sort is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Merge sort is a divide and conquer algorithm that was invented by John von Neumann in 1945.

Quick Sort.

Quicksort  is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order. Developed by Tony Hoare in 1959 .It is still a commonly used algorithm for sorting. When implemented well, it can be about two or three times faster than its main competitors, Merge sort.

Here is the mind map, about Algorithm.

Make your own mind maps with Mindomo.