https://wiki.omnivision.website/index.php?action=history&feed=atom&title=4.2.2.1_Linear_Search 2026-05-23T00:40:45Z Revision history for this page on the wiki MediaWiki 1.43.8 https://wiki.omnivision.website/index.php?title=4.2.2.1_Linear_Search&diff=430&oldid=prev 2025-07-11T22:07:54Z

<p>Created page with &quot;=== 4.2.2.1 Linear Search === &#039;&#039;(Difficulty Note: This is a very intuitive and accessible concept for 7th graders.)&#039;&#039; &#039;&#039;&#039;Linear Search&#039;&#039;&#039; is the simplest way to find something. It&#039;s like looking for a book in a messy pile without any order. You start at the very beginning of the list of items and check each item one by one until you find what you&#039;re looking for, or until you reach the end of the list. &#039;&#039;&#039;How it works:&#039;&#039;&#039; # Start at the first item. # Is this the item y...&quot;</p> <p><b>New page</b></p><div>=== 4.2.2.1 Linear Search ===<br /> &#039;&#039;(Difficulty Note: This is a very intuitive and accessible concept for 7th graders.)&#039;&#039;<br /> <br /> &#039;&#039;&#039;Linear Search&#039;&#039;&#039; is the simplest way to find something. It&#039;s like looking for a book in a messy pile without any order. You start at the very beginning of the list of items and check each item one by one until you find what you&#039;re looking for, or until you reach the end of the list.<br /> <br /> &#039;&#039;&#039;How it works:&#039;&#039;&#039;<br /> <br /> # Start at the first item.<br /> # Is this the item you&#039;re looking for?<br /> #* If Yes, you found it! Stop.<br /> #* If No, move to the next item.<br /> # Keep doing this until you find the item or run out of items to check.<br /> <br /> &#039;&#039;&#039;Example:&#039;&#039;&#039; Imagine you have a list of numbers: &lt;code&gt;[5, 12, 3, 8, 15, 7]&lt;/code&gt; and you&#039;re looking for the number &lt;code&gt;8&lt;/code&gt;.<br /> <br /> * Check &lt;code&gt;5&lt;/code&gt; (No)<br /> * Check &lt;code&gt;12&lt;/code&gt; (No)<br /> * Check &lt;code&gt;3&lt;/code&gt; (No)<br /> * Check &lt;code&gt;8&lt;/code&gt; (Yes!) – You found it!<br /> <br /> &#039;&#039;&#039;When is it used?&#039;&#039;&#039; Linear search works well for short lists or lists that are not sorted in any particular order. It&#039;s easy to understand and program. However, if you have a very long list, it can be slow because you might have to check every single item.<br /> <br /> &#039;&#039;&#039;Bibliography:&#039;&#039;&#039;<br /> <br /> * &#039;&#039;&#039;Linear search facts for kids.&#039;&#039;&#039; (n.d.). &#039;&#039;Kiddle&#039;&#039;. Retrieved July 11, 2025, from https://kids.kiddle.co/Linear_search<br /> * &#039;&#039;&#039;What is Linear Search?&#039;&#039;&#039; (n.d.). &#039;&#039;Programiz&#039;&#039;. Retrieved July 11, 2025, from https://www.programiz.com/dsa/linear-search<br /> <br /> &#039;&#039;&#039;Further Reading:&#039;&#039;&#039;<br /> <br /> * &#039;&#039;&#039;Linear Search Explained.&#039;&#039;&#039; (2020, January 27). &#039;&#039;freeCodeCamp.org&#039;&#039;. Retrieved from https://www.freecodecamp.org/news/linear-search/</div>

Mr. Goldstein