algorithms

Question 1

understand and explain algorithms

Answer 1

à sequence of steps that can be followed to complete à task

Question 2

explain decomposition

Answer 2

breaking a problem into a number of sub problems to accomplish à task

Question 3

abstraction

Answer 3

process of removing unnecessary detail from à problem

Question 4

how are some algorithms more efficient the others

Answer 4

time it takes to run a particular algorithm

Question 5

linear search algorithms

Answer 5

simpler then binary but less efficient
run time is similar
checks each item of the list to find the correct one

Question 6

binary search algorithm

Answer 6

finding the middle item in à less and seeing whether the item is greater or less then the middle number
the takes out the lower/upper half of the list

Question 7

bubble sort algorithm

Answer 7

used to sort an unordered list of items
check each pair of numbers to see if in right position otherwise swap them around
1 +2, 2+3, 3+4

Question 8

bubble sort advantages and disadvantages

Answer 8

advantages
simple algorithm
efficient way to check if a list is in order
does use memory ask much

disadvantages
inefficient way to sort a list
slow for a large list of items

Question 9

merge sort algorithm

Answer 9

sorts list apart and then merged them together
split list in half until only one item in all list
merge pairs of sub lists and sort items into right order

Question 10

merge sort pros and cons

Answer 10

pros
more efficient to sort for larger list
similar running time is
consistent running time

cons
if the list is already sorted it goes through the whole process again
uses more memory