{"id":403,"date":"2018-01-22T14:42:24","date_gmt":"2018-01-22T14:42:24","guid":{"rendered":"http:\/\/learnlearn.uk\/gcsecs\/?page_id=403"},"modified":"2018-03-22T14:23:35","modified_gmt":"2018-03-22T14:23:35","slug":"search-algorithms","status":"publish","type":"page","link":"https:\/\/learnlearn.uk\/gcsecs\/search-algorithms\/","title":{"rendered":"Search Algorithms"},"content":{"rendered":"\n<div class=\"arconix-tabs-horizontal\"><ul class=\"arconix-tabs\"><li data-arconix-icon=\" \" data-arconix-color=\" \" class=\"arconix-tab tab-Starter\"><a class=\"\" href=\"#tab-Starter\">Starter<\/a><\/li>\n<li data-arconix-icon=\" \" data-arconix-color=\" \" class=\"arconix-tab tab-SearchAlgorithms\"><a class=\"\" href=\"#tab-SearchAlgorithms\">Search Algorithms<\/a><\/li>\n<li data-arconix-icon=\" \" data-arconix-color=\" \" class=\"arconix-tab tab-LinearvsBinarySearch\"><a class=\"\" href=\"#tab-LinearvsBinarySearch\">Linear vs Binary Search<\/a><\/li>\n<li data-arconix-icon=\" \" data-arconix-color=\" \" class=\"arconix-tab tab-TutorialVideo\"><a class=\"\" href=\"#tab-TutorialVideo\">Tutorial Video<\/a><\/li>\n<li data-arconix-icon=\" \" data-arconix-color=\" \" class=\"arconix-tab tab-Activity1\"><a class=\"\" href=\"#tab-Activity1\">Activity 1<\/a><\/li>\n<li data-arconix-icon=\" \" data-arconix-color=\" \" class=\"arconix-tab tab-Activity2\"><a class=\"\" href=\"#tab-Activity2\">Activity 2<\/a><\/li>\n<li data-arconix-icon=\" \" data-arconix-color=\" \" class=\"arconix-tab tab-Activity3\"><a class=\"\" href=\"#tab-Activity3\">Activity 3<\/a><\/li><\/ul>\n<div class=\"arconix-panes\"><div class=\"arconix-pane pane-Starter\">\n<h3>Starter<\/h3>\n<ul>\n<li>Searching Game? how quick to find the letter using scratch<\/li>\n<li>How quick to find the word using trinket<\/li>\n<li>Board version &#8211; 20 questions<\/li>\n<li>Higher or lower game?<\/li>\n<\/ul>\n<\/div>\n<div class=\"arconix-pane pane-SearchAlgorithms\">\n<div class=\"arconix-column-two-thirds\">\n<h3>Search Algorithms<\/h3>\n<p><strong>What are search algorithms and why do we need them?<\/strong><br \/>\nOften on your smart phone you might search for:<br \/>\n<div class=\"arconix-list\" data-arconix-icon=\"fa-chevron-circle-right\" data-arconix-color=\"black\">\n<ul>\n<li>a contact in order to call me<\/li>\n<li>a business or group on social media<\/li>\n<li>a location on a map<\/li>\n<\/ul>\n<\/div><br \/>\nComputers store a massive amount of information, and it would be impractical (if not impossible) to look for all the data we need manually. This means that computers need to be able to search through information to find it. What method the computer uses is known as the search algorithm.<br \/>\n<\/div><br \/>\n<div class=\"arconix-column-one-third\">\n<img decoding=\"async\" loading=\"lazy\" class=\"alignnone size-medium wp-image-56\" src=\"https:\/\/learnlearn.uk\/algorithms\/wp-content\/uploads\/sites\/12\/2017\/01\/search-300x205.jpg\" alt=\"search\" width=\"300\" height=\"205\" \/><br \/>\n<\/div><\/p>\n<\/div>\n<div class=\"arconix-pane pane-LinearvsBinarySearch\">\n<h3>Linear Search<\/h3>\n<p>A linear search algorithm is an algorithm that starts at the beginning of a list and goes through each item in the list, looking for a match.<br \/>\n<strong>Advantages<\/strong><br \/>\n<div class=\"arconix-list\" data-arconix-icon=\"fa-chevron-circle-right\" data-arconix-color=\"black\">\n<ul>\n<li>Very simple<\/li>\n<li>Can be using on sorted or unsorted lists<\/li>\n<\/ul>\n<\/div><br \/>\n<strong>Disadvantages<\/strong><br \/>\n<div class=\"arconix-list\" data-arconix-icon=\"fa-chevron-circle-right\" data-arconix-color=\"black\">\n<ul>\n<li>Very slow<\/li>\n<\/ul>\n<\/div><\/p>\n<h3>Binary Search<\/h3>\n<p>A binary search algorithm is an algorithm that starts in the centre of a list and finds out of the value is greater or less than the value at the mid point (or if it is the value!)<br \/>\nThe unused part of the list it then discarded and the process begins all over again.<br \/>\n<strong>Advantages<\/strong><br \/>\n<div class=\"arconix-list\" data-arconix-icon=\"fa-chevron-circle-right\" data-arconix-color=\"black\">\n<ul>\n<li>Very Fast, even with massive data sets<\/li>\n<\/ul>\n<\/div><br \/>\n<strong>Disadvantages<\/strong><br \/>\n<div class=\"arconix-list\" data-arconix-icon=\"fa-chevron-circle-right\" data-arconix-color=\"black\">\n<ul>\n<li>Can only be used with sorted lists<\/li>\n<\/ul>\n<\/div><\/p>\n<\/div>\n<div class=\"arconix-pane pane-TutorialVideo\">\n<h3>Binary vs Linear Search<\/h3>\n<div class=\"nv-iframe-embed\">\n<div class=\"container-lazyload preview-lazyload container-youtube js-lazyload--not-loaded\"><a href=\"https:\/\/www.youtube.com\/watch?v=wNVCJj642n4\" class=\"lazy-load-youtube preview-lazyload preview-youtube\" data-video-title=\"Algorithms Lesson 5: Linear and Binary Searching\" title=\"Play video &quot;Algorithms Lesson 5: Linear and Binary Searching&quot;\">https:\/\/www.youtube.com\/watch?v=wNVCJj642n4<\/a><noscript>Video can&#8217;t be loaded because JavaScript is disabled: <a href=\"https:\/\/www.youtube.com\/watch?v=wNVCJj642n4\" title=\"Algorithms Lesson 5: Linear and Binary Searching\">Algorithms Lesson 5: Linear and Binary Searching (https:\/\/www.youtube.com\/watch?v=wNVCJj642n4)<\/a><\/noscript><\/div>\n<\/div>\n<\/div>\n<div class=\"arconix-pane pane-Activity1\">\n<p><strong>Activity 1 &#8211; Card Sorting<\/strong><\/p>\n<p>Download and print a set of number cards ( You only need to print cards 1 to 20)<\/p>\n<p>Cut out your cards and practice using a linear and binary search algorithm to search through for a number.<\/p>\n<\/div>\n<div class=\"arconix-pane pane-Activity2\">\n<p><strong>Activity 2 &#8211; Write your own algorithm<\/strong><\/p>\n<p>Using a language of your choice (e.g. Python or Scratch) write your own binary and linear search algorithms.<\/p>\n<h3>Activity 1 &#8211; Search practice<\/h3>\n<\/div>\n<div class=\"arconix-pane pane-Activity3\">\n<strong>Activity 3 &#8211; Learning Log<\/strong><\/p>\n<p>Complete your learning log for today&#8217;s lesson.<\/p>\n<\/div><\/div><\/div>\n\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"neve_meta_sidebar":"","neve_meta_container":"","neve_meta_enable_content_width":"","neve_meta_content_width":0,"neve_meta_title_alignment":"","neve_meta_author_avatar":"","neve_post_elements_order":"","neve_meta_disable_header":"","neve_meta_disable_footer":"","neve_meta_disable_title":""},"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v20.6 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Search Algorithms - GCSE Computer Science Theory<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/learnlearn.uk\/gcsecs\/search-algorithms\/\" \/>\n<meta property=\"og:locale\" content=\"en_GB\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Search Algorithms - GCSE Computer Science Theory\" \/>\n<meta property=\"og:url\" content=\"https:\/\/learnlearn.uk\/gcsecs\/search-algorithms\/\" \/>\n<meta property=\"og:site_name\" content=\"GCSE Computer Science Theory\" \/>\n<meta property=\"article:modified_time\" content=\"2018-03-22T14:23:35+00:00\" \/>\n<meta property=\"og:image\" content=\"http:\/\/learnlearn.uk\/algorithms\/wp-content\/uploads\/sites\/12\/2017\/01\/search-300x205.jpg\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Estimated reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/learnlearn.uk\/gcsecs\/search-algorithms\/\",\"url\":\"https:\/\/learnlearn.uk\/gcsecs\/search-algorithms\/\",\"name\":\"Search Algorithms - GCSE Computer Science Theory\",\"isPartOf\":{\"@id\":\"https:\/\/learnlearn.uk\/gcsecs\/#website\"},\"datePublished\":\"2018-01-22T14:42:24+00:00\",\"dateModified\":\"2018-03-22T14:23:35+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/learnlearn.uk\/gcsecs\/search-algorithms\/#breadcrumb\"},\"inLanguage\":\"en-GB\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/learnlearn.uk\/gcsecs\/search-algorithms\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/learnlearn.uk\/gcsecs\/search-algorithms\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"OCR GCSE Computer Science Home\",\"item\":\"https:\/\/learnlearn.uk\/gcsecs\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Search Algorithms\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/learnlearn.uk\/gcsecs\/#website\",\"url\":\"https:\/\/learnlearn.uk\/gcsecs\/\",\"name\":\"GCSE Computer Science Theory\",\"description\":\"Just another My Blog site\",\"publisher\":{\"@id\":\"https:\/\/learnlearn.uk\/gcsecs\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/learnlearn.uk\/gcsecs\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-GB\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/learnlearn.uk\/gcsecs\/#organization\",\"name\":\"GCSE Computer Science Theory\",\"url\":\"https:\/\/learnlearn.uk\/gcsecs\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-GB\",\"@id\":\"https:\/\/learnlearn.uk\/gcsecs\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/learnlearn.uk\/gcsecs\/wp-content\/uploads\/sites\/8\/2019\/02\/LearnLearnLogowhite.png\",\"contentUrl\":\"https:\/\/learnlearn.uk\/gcsecs\/wp-content\/uploads\/sites\/8\/2019\/02\/LearnLearnLogowhite.png\",\"width\":710,\"height\":98,\"caption\":\"GCSE Computer Science Theory\"},\"image\":{\"@id\":\"https:\/\/learnlearn.uk\/gcsecs\/#\/schema\/logo\/image\/\"}}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Search Algorithms - GCSE Computer Science Theory","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/learnlearn.uk\/gcsecs\/search-algorithms\/","og_locale":"en_GB","og_type":"article","og_title":"Search Algorithms - GCSE Computer Science Theory","og_url":"https:\/\/learnlearn.uk\/gcsecs\/search-algorithms\/","og_site_name":"GCSE Computer Science Theory","article_modified_time":"2018-03-22T14:23:35+00:00","og_image":[{"url":"http:\/\/learnlearn.uk\/algorithms\/wp-content\/uploads\/sites\/12\/2017\/01\/search-300x205.jpg"}],"twitter_card":"summary_large_image","twitter_misc":{"Estimated reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/learnlearn.uk\/gcsecs\/search-algorithms\/","url":"https:\/\/learnlearn.uk\/gcsecs\/search-algorithms\/","name":"Search Algorithms - GCSE Computer Science Theory","isPartOf":{"@id":"https:\/\/learnlearn.uk\/gcsecs\/#website"},"datePublished":"2018-01-22T14:42:24+00:00","dateModified":"2018-03-22T14:23:35+00:00","breadcrumb":{"@id":"https:\/\/learnlearn.uk\/gcsecs\/search-algorithms\/#breadcrumb"},"inLanguage":"en-GB","potentialAction":[{"@type":"ReadAction","target":["https:\/\/learnlearn.uk\/gcsecs\/search-algorithms\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/learnlearn.uk\/gcsecs\/search-algorithms\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"OCR GCSE Computer Science Home","item":"https:\/\/learnlearn.uk\/gcsecs\/"},{"@type":"ListItem","position":2,"name":"Search Algorithms"}]},{"@type":"WebSite","@id":"https:\/\/learnlearn.uk\/gcsecs\/#website","url":"https:\/\/learnlearn.uk\/gcsecs\/","name":"GCSE Computer Science Theory","description":"Just another My Blog site","publisher":{"@id":"https:\/\/learnlearn.uk\/gcsecs\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/learnlearn.uk\/gcsecs\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-GB"},{"@type":"Organization","@id":"https:\/\/learnlearn.uk\/gcsecs\/#organization","name":"GCSE Computer Science Theory","url":"https:\/\/learnlearn.uk\/gcsecs\/","logo":{"@type":"ImageObject","inLanguage":"en-GB","@id":"https:\/\/learnlearn.uk\/gcsecs\/#\/schema\/logo\/image\/","url":"https:\/\/learnlearn.uk\/gcsecs\/wp-content\/uploads\/sites\/8\/2019\/02\/LearnLearnLogowhite.png","contentUrl":"https:\/\/learnlearn.uk\/gcsecs\/wp-content\/uploads\/sites\/8\/2019\/02\/LearnLearnLogowhite.png","width":710,"height":98,"caption":"GCSE Computer Science Theory"},"image":{"@id":"https:\/\/learnlearn.uk\/gcsecs\/#\/schema\/logo\/image\/"}}]}},"rttpg_featured_image_url":null,"rttpg_author":{"display_name":"learnlearnadmin","author_link":"https:\/\/learnlearn.uk\/gcsecs\/author\/learnlearnadmin\/"},"rttpg_comment":0,"rttpg_category":null,"rttpg_excerpt":null,"_links":{"self":[{"href":"https:\/\/learnlearn.uk\/gcsecs\/wp-json\/wp\/v2\/pages\/403"}],"collection":[{"href":"https:\/\/learnlearn.uk\/gcsecs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/learnlearn.uk\/gcsecs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/learnlearn.uk\/gcsecs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/learnlearn.uk\/gcsecs\/wp-json\/wp\/v2\/comments?post=403"}],"version-history":[{"count":8,"href":"https:\/\/learnlearn.uk\/gcsecs\/wp-json\/wp\/v2\/pages\/403\/revisions"}],"predecessor-version":[{"id":542,"href":"https:\/\/learnlearn.uk\/gcsecs\/wp-json\/wp\/v2\/pages\/403\/revisions\/542"}],"wp:attachment":[{"href":"https:\/\/learnlearn.uk\/gcsecs\/wp-json\/wp\/v2\/media?parent=403"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}