computing

computing

1. algorithm

   • Basic algorithm
     • Basic algorithm is a task you want the computer to carry out. you have to give it the right list of step by step instructions or algorithm.
       • a good algorithm has clear extrusions and dose the job quickly and effetely.
         • for example seeing if your lamp don’t work . You have to give simple tacks inset of listing want to do. You have to do it in order of what comes first.
   • Checking you algorithm
     • computer need good algorithm to work, for example if you just tell the computer to cut the grass you are not telling it when to stop, how much to cut and what to cut with This is why it best to check your algorithm
       • firstly you need to check if you algorithm is complet
         • Secondly is the algorithm easy understand
           • Fierily is your algorithm affects
   • Searching algorithms
     • there are many different kind of Searching algorithms but tow most common are linear searches and binary searches
       • Linear searches tells the computer to go through the data from beginning to end until it finds what you are looking for. But this would be very slow if you are trying to go through a big bit of dater
       • binary searches only working if the date you are smirching through is in order. For example lets say you are going along a time Lind the goes from 1 to 10. the computer goes halfway along the collection and then checks if it's gone past the number. looking for if not then it knows it's not in the first half of the date and so it can ignore it all or vice-vers ( e.g it land on 5 and 5 < 7 so it ignores 1 to 5)
   • Sorting algorithms
     • some sorting algorithms are more efficient than others so it depends on what you need
       • Bubble is the most simple out of all of the sorting algorithms. You fist look at the first two numbers and swap them if they are out of order. for example 45 and 11. 11 is small than 45 so you swap it. This keep going un till the dater bis in order.
         • Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm.

Bilder und Dateien der Mindmap