Linear Search, Starts from the beginning of the list, Each item is checked in turn, List does not need to be in order, Efficient for smaller lists, Inefficient for larger lists, Binary Search, Calculates a mid-point in the list, Checks to see if the mid-point is the item being searched for, If not discard half of a list and repeat on the new list, List needs to be in order, More efficient than a linear search on average

2.1 Searching Algorithms

由
列印
嵌入

排行榜

視覺風格

選項

切換範本

恢復自動保存: ?