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

만든이
인쇄
퍼가기

순위표

비주얼 스타일

옵션

템플릿 전환하기

자동 저장된 게임을 복구할까요?