____ Search: 1. Find the ____ item in the ____ list. 2. If this is the item you're looking for, then stop the search - you've found it. 3. If not, ____ the item you're looking for to the ____. If it comes before the middle term, get ____ of the second half of the list. If it comes after the middle item, get rid of the first half of the list. 4. You'll be left with a list that is ____ the size of the ____ list. ____ steps 1 to 3 on this smaller list to get an even smaller list. Keep going until you find the item you're looking for. ____ Sort: The bubble sort algorithm is used to sort an ____ list of items. The algorithm is very ____ but can often take a while to actually sort a list. 1. Look at the first ____ items in the list. 2. If they're in the ____ order, you don't have to do anything. If they are in the wrong order, swap them. 3. ____ on to the ____ of items (the 2nd and 3rd entries) and repeat the 2nd step. 4. Repeat Step 3 until you get to the end of the list - this is called one pass. The last item will now be in the ____ place, so don't include it in the next pass. 5. ____ Steps 1 - 4 until there are no swaps. The ____ sort is considered to be one of the ____ ____ ____ as it only ever focuses on ____ items rather than the ____ list of items. ____ include: > It's a simple algorithm that can be easily implemented on a computer. > It's an efficient way to check if a list is already in order. > Doesn't take very much memory as all the sorting is done using the original list. Disadvantages: > Due to being ____, the bubble sort algorithm does not cope well with ____ list of items.,

Binary Search & Bubble Sort

Nyomtatás...
Beágyazás

Ranglista

Vizuális stílus

Beállítások

Kapcsoló sablon

Automatikus mentés visszaállítása :?