____ SEARCH Start with the ____ value in the list. ____ it to the search value. If it ____ stop. If it doesn’t move to the ____ item. ____ this until you find the item or have ____ every value. ____ SEARCH Find the ____ value in the list. If the value is greater than the search value (numerically or alphabetically) then discard the ____ side . If the value is ____ than the search value (numerically or alphabetically) then discard the left side . ____ steps 1-3 until the ____ value is found. BINARY SEARCH - FINDING THE MIDDLE VALUE Count the ____ of the list. ____ the length by two. Round ____ the number if needed. Go to that ____ in the list. BUBBLE SORT Starting with the ____ value, ____ the value with the next value of the list. If the current value is ____ than the next value, ____ the values. If the current value is ____ than the next value, move to the next value in the list. Write the rest of the ____ down and go to a ____ line. Continue on a new line with the ____ set of numbers. INSERTION SORT The ____ value is inserted into new sub-list. The second item is ____ to the first value. If the value is ____, it is inserted onto a new line in ____ with the other value/s. If the value is ____, it is inserted onto a new line in the ____ order with the other value/s. This process is ____ with all the values until all values have been inserted into the new list in the ____ order. MERGE SORT - DIVIDE PHASE List is ____ in half. This is ____ until each list has only ____ item. MERGE - SORT PHASE The lists are ____ together ____ at a time, repeating the same ____ as the divide phase. As each ____ is merged the items are put in ____.

ALGORITHMS

Drukuj
Osadź

Tabela rankingowa

Motyw

Opcje

Zmień szablon

Przywrócić automatycznie zapisane ćwiczenie: ?