Fundamentals of Algorithms GapFill

An algorithm is a graphical representation of the steps that need to be followed to solve a problem a computer program that is used to solve a problem a series of steps that is used to solve a problem a computer program that uses subroutines . Two key terms are used to define algorithms; decomposition dividing flowcharts components is the process of breaking down a problem into identifiable tasks and abstraction is a way to use flowcharts to show how to solve the problem organise the computer to solve the problem hide unnecessary details and focus on the important elements create the correct number of subroutines to solve the problem to solve the problem.

There are many different types of algorithm, including searching and sorting algorithms. The following is an implementation of a linear search algorithm:

numbers ← [4,8,7,1,2]
found ← 1 FALSE 12 TRUE 
toFind ← ASC str USERINPUT output 
index ← 0
WHILE found = False AND index >= == <  <=  LEN(numbers)
   IF numbers[index]=toFind THEN
      found ← True
      PRINT('That number is in the list')
   ELSE
      index ← numbers[index] toFind=numbers[index] index +1 index[numbers] 
   ENDIF
ENDWHILE
IF found=False THEN
   PRINT('That number is not in the list')
ENDIF  

The linear search algorithm checks every element in a list in the order that they appear until the element that is being searched for is found, or it reaches the end of the list. If the list is twice as long, searching using this technique will, on average, require twice as much time. To speed up searching, the quick binary bucket merge search algorithm can be used instead. This algorithm checks the lowest second first middle element of the list, and if the element being checked is not the same element that is being searched for, that element is discarded along with every element that comes before or after it in the list (depending on whether the element being checked is lower or higher than the element being searched for). This type of search can be significantly faster than a linear search, but can only be used if the list has an odd number of elements is short is unsorted is sorted .

Sorting algorithms can be used to rearrange the order of elements in a list. There are a number of sorting algorithms which include the merge binary bucket quick sort splits the list into single elements and combines them into larger and larger sorted lists; and the merge insertion binary bubble sort, which goes along the list to check every pair of elements and swaps elements that are in the wrong order.  For text large numerical small sets of data the merge sort is much more efficient than the bubble sort.