1. A PowerPoint about Algorithm’s

2. What is an algorithm? A list Of cammands / instructions to do a tasks

3. START GET CUP PUT TEA BAG IN PUT MILK IN PUT SUGAR IN? STIR IT END NO YES START Put water in kettle Boil kettle Get a cup and put a tea bag in Pour water in kettle Remove tea bag Put milk in? Put sugar in? END NO YES NO They forgot the water & they don’t say how much. Also it’was missing steps They still don’t give you an opshon to say how much of what & what if you don’t know how to turn on kettle? Also this is not the set of cammands to make tea – because its missing steps Also it has a logic error! Also if it’s too long it wont be as a efficient as it could be. Because there could be too many steps witch takes too long to right out.

4. Searching for data…. Using Algorithms. What is a linear search algorithm? It’s when it searching for it one by one (long way) What is a binary search algorithm? It’s when it searching by halfing & halfing again untill it finds it (a lot of the time faster)

5. Which is best when searching for data? Why? Use an example and give the good and bad points of each search method I would say binary search most of the times because if there’s a lot of thing to search though it’s eayer to half & half again to find it a lot faster! For example with the game guess who it would have been better to use binary search to because it would of taken a lot more turns to find out with linear search. And that’s because in guess who many people ask if it is a boy or girl witch will half the amount of guesses. Also if using binary it could take up to 5 to 8 goes to win but with linear search it could take up to 24 goes to win

6. Sorting out date! Selection is were you look though it until you find the 1 st one then look though it again until you got all of them into the right order. (It’s not the fasts way of sorting) Bubble is were you look at one then put it into a place then the next one you see if it goes lower or higher than the 1 st one. Merge is were you put them into groups of half then you sort them in there groups then put them back together. (But putting them into groups could west time) Selection is were you look though it until you find the 1 st one then look though it again until you got all of them into the right order. (It’s not the fasts way of sorting) Bubble is were you look at one then put it into a place then the next one you see if it goes lower or higher than the 1 st one. Merge is were you put them into groups of half then you sort them in there groups then put them back together. (But putting them into groups could west time)