Computer Science Homework

Computer Science Homework

1. Linear Search

   • What is it?
     • In Linear Search Data values don’t need to be in order. To find a specific number. You would need to check each individual value until you get the correct value your looking for. This is simple to understand for beginners
   • Example
     • An example of this could be: Me needing the number 43 The Values are 33,26,8,43,4,99 So to try and find the number 43 i would need to Check the first value if its not 43,Check the second value and then repeat these steps to get 43.
   • Advantages:
     • Very Simple
     • Doesn't need to be in ordered lists
     • Great for Smaller Lists
   • Disadvantages
     • Inefficient for large lists
     • A lot worse than Binary search

2. Binary Search

   • What is it?
     • Binary Search is when you have various data values that you need to search through to get to your Number/Value. These Values need t be in order You can do this by adding the number of values together + 1 and divide by 2. Then you will find the middle value, if it appears to be a decimal you can round it up or down to get a value. If it’s your value then stop. If the value is not the one you're looking for then do this again. But if the value you get is large or smaller than your number eliminate the other values that are either bigger or smaller.To cut down the values to make it easier to get your value
   • Example
     • An example of this is my number is 87 The values are 12,32,45,64,87,99,104 So there’s 7 values. 7+1/2 = 4 So check 4th value = 64 Is 87 greater than 64? Yes So remove numbers <64 and 64. So the only values left are 87,99,104 Do the same method Which leaves you with 99 But 99>87 So remove 99 and the other brigger values That now gives you 87
   • Advantages
     • More efficient than Linear Search (Quicker)
     • Fantastic for larger lists
   • Disadvantages
     • Values need to be in order
     • Harder to do than Linear Search

3. Bubblesort

   • What is it?
     • Bubble sort is about sorting out values/numbers into the correct order. It's very simple but can take a while. To order these numbers,there will be a list of numbers and to get the correct values in order. You need to check 2 numbers and determine whether they are in the same order by judging the number size. Then if they are in order than move onto the next values and do this until all values are in order.
   • Example
     • An example of how to do this is: Ordering these smallest to largest. 13,43,25,67,99 So check the first numbers. They are in the correct order. Move onto 43,25 and swap them round as they aren’t in order. Then go to 43,67 are they in the correct order? Yes Then go check 67,99. They are in the correct order So now your list is sorted
   • Advantages
     • Simple algorithm to output
     • Effective to check if numbers are in order
   • Disadvantages
     • Not very efficient as this algorithm takes time
     • Awful for large lists.