Please enable JavaScript.

Coggle requires JavaScript to display documents.

Mock Paper 2 (Topic 2: Data Representations (Binary (Counting binary is a…

- - - - Selections
      - Iterations
      - Sequences
  - - - Merge Sort
        
        It basically does what the name is. It splits the list in half and puts it back together. Small lists are easier to sort than large lists. It's easier to merge two ordered lists than two unordered lists. The steps are as followed: 1) Split the list in half (the smaller lists are called sub-lists) - the second sub-list should start at the middle item. 2) keep repeating step one on each sub-task until all the lists only contain one item. 3) Merge pairs of sub-lists so that each sub-list has twice as many items. Each time you merge sub-lists, sort the item into the right order. 4)Repeat step 3 until you've merged all the sub-lists together.
      - Bubble sort:
        
        This sort uses jumbled up numbers and putting them in the correct order. The order consists of these rules. 1) Look at the first number of the list. 2) Compare the current number with the next number. 3) Is the next number smaller than the current number? If so, swap the two numbers around. if not, do not swap. 4) Move to the next number along in the list and make this the current number. 5) Repeat from step 2 until the last number has been reached. 6) If any numbers were swapped, repeat again from step 1. 7) If the end of the list is reached without any swaps being made, then the list is In ordered and the algorithm can stop. it is now complete. EXAMPLE:
      - insertion sort
        
        The insertion sort algorithm is the simplest sorting algorithm to understand - it just takes each item in turn and puts it in the right place using the first item in the list as a starting point. the steps are as follows: 1) look at the second item in a list. 2) compare it to all items before it (in this case the first item) and insert the number into the right place. 3) repeat step 2 for the third, forth, fifth, etc. items until the last number in the list has been inserted into the correct place.
    - - binary
        
        A binary search looks for items in a ordered list. the steps in which this happens are as follows: 1) find the middle item in the ordered list (if necessary - ( n + 1 ) +2 ) 2) if this is the item you're looking for, then stop the search 3) if not, compare the items you're looking for to the middle item. if it comes before the middle item, get rid of the second half of the list. if it comes after the middle item, get rid of the first half of the list. 4) you'll be left with a list that is half the size of the original list. repeat step 1 - 3 on this smaller list to get an even smaller one. keep going until you find the item you're looking for.
      - linear
        
        A linear search can be used on an unordered list. A linear search checks each item of the list in turn to see if it's the correct one. if it stops when it either finds the item it's looking for, or has checked everything 1) look at the first item in the unordered list. 2) if this is the item you're looking for, then stop the search 3) if not, then look at the next item in the list 4) repeat step 2 - 3 until you find the item you're looking for or you've checked every item. linear searches are more simple than a binary but not as efficient.