LINEAR SEARCH 1. Start with the ____ value in the list. 2. ____ it to the search value. 3. If it matches ____. 4. If it doesn’t move to the ____ value. 5. ____ this until you find the search value or have checked ____ value. BINARY SEARCH - FINDING THE MIDDLE VALUE a. Count the ____ of the list. b. ____ the length by ____. c. ____ ____ the number if needed. d. Go to that ____ in the list. BINARY SEARCH 1. Find the ____ value in the list. 2. If the middle value is ____ than your search value, then discard the ____ side. 3. If the middle value is ____ than your search value, then discard the ____ side. 4. ____ steps 1, 2 and 3 until the search value is found. LINEAR SEARCH 1. Start with the ____ value in the list. 2. ____ it to the search value. 3. If it matches ____. 4. If it doesn’t move to the ____ value. 5. ____ this until you find the search value or have checked ____ value. BINARY SEARCH - FINDING THE MIDDLE VALUE a. Count the ____ of the list. b. ____ the length by ____. c. ____ ____ the number if needed. d. Go to that ____ in the list. BINARY SEARCH 1. Find the ____ value in the list. 2. If the middle value is ____ than your search value, then discard the ____ side. 3. If the middle value is ____ than your search value, then discard the ____ side. 4. ____ steps 1, 2 and 3 until the search value is found.

SEARCHING ALGORITHMS

列印
嵌入

排行榜

視覺風格

選項

切換範本

恢復自動保存: ?