Please enable JavaScript.

Coggle requires JavaScript to display documents.

Computational Thinking (Programming Techniques (Data Types (Int - A Whole…

- - - - Find the middle item, if it is lower than the value you are looking for the first half is deleted, if higher the second half is deleted.
        Find the new middle item and test that.
        Keep repeating until the value is found.
      - Best for lists that are ordered
    - - Search the first item, if it is the item you're looking for then stop
        If not move onto the next item and repeat until the item is found
      - Best for lists that aren't ordered
  - - - A bubble sort compares pairs of items starting with the first two, then the second and third item. if the items are unordered, they are swapped. After one pass only the last item is in the correct place, so multiple passes must be done.
      - Pros -
        
        It's a simple easily implemented algorithm
        
        It's an efficient way to check if it is in order
        
        Doesn't use much memory
      - Cons -
        
        It's an inefficient way to sort lists, for a list of n items, the worst case is doing n(n-1) / 2
        
        Due to being inefficient, doesn't work well with large lists
    - - A merge sort splits the list into it's separate items then the items are put together into lists of two, the lists of two are then collated to lists of four and so on until the list is complete and ordered.
      - Pros -
        
        More efficient than the others
        
        Consistent running time no matter how ordered the original list is.
      - Cons -
        
        Slower for smaller lists
        
        Even if list is sorted still splits and sorts
        
        Uses more memory to create separate lists
    - - An insertion sort looks at the second item then compares it to items before it. the item is inserted in the right place and the next item is looked at.
- - - - This gate returns a 1 only if both inputs are also 1
    - - This gate returns a 1 if either or both inputs are a 1
    - - This gate returns a 1 if the input is 0
- - - - This is done using an analogue to digital converter. The process is called sampling. At regular intervals the amplitude of the sound is recorded but this results in a loss of data. To improve the shape of the curve the sampling frequency is increased