Karteikarten
Algorithms
Karten in diesem Stapel (11)
- 1Linear SearchIn computer science, linear search or sequential search is a method for finding a target value within a list. It sequentially checks each number of the list for the target value until a match is found or until all the elements have been searched.
- 2Binary SearchIn computer science, binary search, also known as half-interval search or logarithmic search, is a search algorithm that finds the position of a target value within a sorted array.
- 3Bubble SortBubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order.
- 4Insertion SortInsertion sort is a sorting algorithm that sorts one number at a time. Most humans, when sorting a deck of cards, will use a strategy similar to insertion sort.
- 5Merge SortIn computer science, merge sort (also commonly spelled merge sort) is an efficient, general-purpose, comparison-based sorting algorithm.
- 6ArrayA list of numbers.
- 7StringA group of words.
- 8Binary Addition Rules :1 + 0 = 1
0 + 0 = 0
1 + 1 = 0 (Carry 1)
1 + 1 + (carried) = 1 and (carried 1) - 9Overflow Errorsif the result of binary addition is higher than 255 the 8 bit system needs to become a 9 bit system
- 10Binary Shift Leftmoves all the binary number to the left increasing the denary number
- 11Binary Shift RightMoves a binary digit to the right decreasing the denary.