{"id":175,"date":"2024-07-30T06:50:33","date_gmt":"2024-07-30T06:50:33","guid":{"rendered":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/chapter\/introduction-3\/"},"modified":"2026-03-16T14:30:55","modified_gmt":"2026-03-16T14:30:55","slug":"introduction-3","status":"publish","type":"chapter","link":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/chapter\/introduction-3\/","title":{"raw":"Introduction","rendered":"Introduction"},"content":{"raw":"<div class=\"introduction\">\n<h3>Description<\/h3>\nThis chapter introduces Big-O runtimes, a standard metric for analyzing the efficiency of algorithms that is independent of the hardware used to implement the [pb_glossary id=\"236\"]algorithm[\/pb_glossary]. Big-O allows for a meaningful comparison between different implementations of a particular algorithm.\n<div class=\"textbox textbox--learning-objectives\"><header class=\"textbox__header\">\n<p class=\"textbox__title\">Learning Objectives<\/p>\n\n<\/header>\n<div class=\"textbox__content\">\n<ul>\n \t<li>Determine basic space\/time requirements of algorithms (Big O) and evaluate trade-offs in algorithm selection for a variety of problems<\/li>\n \t<li>Understand basic algorithm analysis<\/li>\n<\/ul>\n<\/div>\n<\/div>\nBy the end of this chapter, you should be able to answer the following questions:\n\n- How is Big O used to compare algorithms?\n\n- What does Big O measure?\n\n- What are the six standard runtimes?\n\n&nbsp;\n\n<\/div>","rendered":"<div class=\"introduction\">\n<h3>Description<\/h3>\n<p>This chapter introduces Big-O runtimes, a standard metric for analyzing the efficiency of algorithms that is independent of the hardware used to implement the <a class=\"glossary-term\" aria-haspopup=\"dialog\" aria-describedby=\"definition\" href=\"#term_175_236\">algorithm<\/a>. Big-O allows for a meaningful comparison between different implementations of a particular algorithm.<\/p>\n<div class=\"textbox textbox--learning-objectives\">\n<header class=\"textbox__header\">\n<p class=\"textbox__title\">Learning Objectives<\/p>\n<\/header>\n<div class=\"textbox__content\">\n<ul>\n<li>Determine basic space\/time requirements of algorithms (Big O) and evaluate trade-offs in algorithm selection for a variety of problems<\/li>\n<li>Understand basic algorithm analysis<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<p>By the end of this chapter, you should be able to answer the following questions:<\/p>\n<p>&#8211; How is Big O used to compare algorithms?<\/p>\n<p>&#8211; What does Big O measure?<\/p>\n<p>&#8211; What are the six standard runtimes?<\/p>\n<p>&nbsp;<\/p>\n<\/div>\n<div class=\"glossary\"><span class=\"screen-reader-text\" id=\"definition\">definition<\/span><template id=\"term_175_236\"><div class=\"glossary__definition\" role=\"dialog\" data-id=\"term_175_236\"><div tabindex=\"-1\"><p>An algorithm is an explicit sequence of instructions, performed on data, to accomplish a desired objective.<\/p>\n<\/div><button><span aria-hidden=\"true\">&times;<\/span><span class=\"screen-reader-text\">Close definition<\/span><\/button><\/div><\/template><\/div>","protected":false},"author":1,"menu_order":1,"template":"","meta":{"pb_show_title":"","pb_short_title":"","pb_subtitle":"","pb_authors":[],"pb_section_license":""},"chapter-type":[49],"contributor":[],"license":[],"class_list":["post-175","chapter","type-chapter","status-publish","hentry","chapter-type-numberless"],"part":174,"_links":{"self":[{"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/pressbooks\/v2\/chapters\/175","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/pressbooks\/v2\/chapters"}],"about":[{"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/wp\/v2\/types\/chapter"}],"author":[{"embeddable":true,"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/wp\/v2\/users\/1"}],"version-history":[{"count":2,"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/pressbooks\/v2\/chapters\/175\/revisions"}],"predecessor-version":[{"id":253,"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/pressbooks\/v2\/chapters\/175\/revisions\/253"}],"part":[{"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/pressbooks\/v2\/parts\/174"}],"metadata":[{"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/pressbooks\/v2\/chapters\/175\/metadata\/"}],"wp:attachment":[{"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/wp\/v2\/media?parent=175"}],"wp:term":[{"taxonomy":"chapter-type","embeddable":true,"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/pressbooks\/v2\/chapter-type?post=175"},{"taxonomy":"contributor","embeddable":true,"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/wp\/v2\/contributor?post=175"},{"taxonomy":"license","embeddable":true,"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/wp\/v2\/license?post=175"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}