Algorithims

Algorithims

1. Computational thinking

   • Is a way of doing things in a logical order only doing what is explicitly said not assuming
   • Abstraction is removing unnecessary detail so you can focus on whats important.
   • Decomposition is breaking down a problem into smaller and smaller problems until you have some easy taks to do.

2. Searching Alogorithms

   • There are two types of lists to search; sorted and unsorted
   • A binary search is like divide and conqour in sorted lists. You begin half-way through and look to half way in the direction it should be sorted into, this continues until you find what you're looking for.
   • A linear search is when you sort through a list that is not sorted and you start at the beginning and check every item until you find the one you are looking for.

3. Bubble merge and insertion sort

   • A bubble sort is when each place of it checks if it is greater than the next one if it is they switch places by the end of the first pass the largest number is at the end
   • This algorithim sorts one piece of data at a time into the correct position in the list.
     • like you do with cards in a hand.
   • Merge list:Divide the unsorted list into n sublists, each containing one element Repeatedly merge two sublists at a time to produce new sorted sublists until there is only one sublist remaining. This is the sorted list. We will use a list of 8 integers to demonstrate the process

4. Flow diagrams

   • Flow diagrams are there to help us to understand programs and algorithims
   • All programs are composed of three basic structures: Sequence, Selection, Iteration (repetition)
   • There are may symbols just look on the Powerpoint for these but think of a few now.

5. Pseudocose

   • Pseudocode is a kind of structured English for describing algorithms It allows the designer to focus on the logic of the algorithm without being distracted by the syntax of the programming language You will see pseudocode statements written in a consistent style in exam questions, but you can use alternative statements so long as the meaning is clear

6. Interpreting and completing algorithims.

   • People can be assisted in following algorithms like computers by trace tables.
     • These work by holding values like a computer does so we don't have to remember them. Computers function like this with variables and follow through like us...