Reply to thread

Message: <blockquote data-quote="imhotep" data-source="post: 24061831" data-attributes="member: 562115">Explain the linear search and the binary search in terms of the big O notation. There should be plenty of resources on the net.a linear search (assuming a sorted list) is parsing through the list to locate the number you seek - say for a list of n numbers, the worst case is n iterations, and so we can say for the linear search is O<img src="data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" class="smilie smilie--sprite smilie--sprite23" alt="(n)" title="Thumbs down    (n)" loading="lazy" data-shortname="(n)" />For a binary search, you start off from the middle element and depending on what we look for is less or greater than this mid element we search through the lower or upper segments using the same technique. This approach takes log<img src="data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" class="smilie smilie--sprite smilie--sprite23" alt="(n)" title="Thumbs down    (n)" loading="lazy" data-shortname="(n)" /> iterations and thus has O(log<img src="data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7" class="smilie smilie--sprite smilie--sprite23" alt="(n)" title="Thumbs down    (n)" loading="lazy" data-shortname="(n)" />)</blockquote>

Top Bottom