Karteikarten
Computer Science Basic Algorithms
Karten in diesem Stapel (10)
- 1BubblesortA bubble sort algorithm compares pairs of items in a list and swap's them over if the order is wrong. e.g. a b c d, the algorithm will first compare a b then b c then c d and so on.
- 2MergesortA merge sort algorithm halves the array until it is separated into single items. These single items then get merged into temporary arrays in the correct order to make pairs. The same happens again and again until the list is completely sorted.
- 3Linear searchLinear search is an algorithm the goes through a single or multidimensional list and checks each item if it is the correct one. If not then the algorithm continues to the next one.
- 4Binary searchA binary search algorithm is split up into indexis for each item. The algorithm first ads the first index and the last index dividing it by two. If the item to be found is greater than half the left side is discarded. The algorithm then does the same again.
- 5/Division
- 6*Multiplication
- 7+Addition
- 8-Subtraction
- 9%Remainder of a division problem
- 10**To the power of
Informationen
- Beschreibung
- Year 10 Computing Karteikarten am Computer Science Basic Algorithms, erstellt von Nicolas Nemec am 19/04/2018.
- Erstellt von
- Nicolas Nemec
- Aufrufe
- 0
- Bewertung