{"id":749,"date":"2024-12-05T13:00:21","date_gmt":"2024-12-05T13:00:21","guid":{"rendered":"https:\/\/pennstudiostaging.co.uk\/craig-n-dave\/?post_type=product&#038;p=749"},"modified":"2025-02-19T11:20:15","modified_gmt":"2025-02-19T11:20:15","slug":"essential-algorithms-and-data-structures-second-edition-book","status":"publish","type":"product","link":"https:\/\/pennstudiostaging.co.uk\/craig-n-dave\/product\/essential-algorithms-and-data-structures-second-edition-book\/","title":{"rendered":"Essential algorithms and Data structures (second edition) book"},"content":{"rendered":"<p style=\"text-align: left;\">Suitable for all exam boards and courses. this PDF is available to download for Craig&#8217;n&#8217;Dave members or in paperback from Amazon.<\/p>\n<p style=\"text-align: left;\">Each chapter includes:<\/p>\n<ul>\n<li style=\"text-align: left;\">A data structure or algorithm, explaining how it works.<\/li>\n<li style=\"text-align: left;\">Real-world applications of the algorithm.<\/li>\n<li style=\"text-align: left;\">A step-by-step example.<\/li>\n<li style=\"text-align: left;\">Pseudocode.<\/li>\n<li style=\"text-align: left;\">Python code examples.<\/li>\n<li>A description of the space and time complexity.<\/li>\n<\/ul>\n<p>Many of the algorithms have been written and exemplified in serveral ways, for example iterative and recursive approaches, array and object implementations.<\/p>\n<p><a href=\"https:\/\/craigndave.org\/product\/algorithms\/\">Source code for all the program is available to download in Python, C# and Visual Basic<\/a>:<\/p>\n<ol>\n<li class=\"brz-tp-lg-paragraph brz-css-bgfhf\" data-uniq-id=\"cmbps\" data-generated-css=\"brz-css-horpg\">A*<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-ohans\" data-uniq-id=\"fdgzw\" data-generated-css=\"brz-css-goidp\">Binary search<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-pwshr\" data-uniq-id=\"ydugl\" data-generated-css=\"brz-css-ptdyh\">Binary tree with an array<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-vawyg\" data-uniq-id=\"lvcjg\" data-generated-css=\"brz-css-wmmps\">Binary tree with objects<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-stcjd\" data-uniq-id=\"znnbu\" data-generated-css=\"brz-css-tgetr\">Bubble sort<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-zrzwh\" data-uniq-id=\"xpwnb\" data-generated-css=\"brz-css-znxaj\">Dictionary<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-ujymt\" data-uniq-id=\"jzqqy\" data-generated-css=\"brz-css-xvkjd\">Dijkstra\u2019s shortest path<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-gxpwh\" data-uniq-id=\"kvgvb\" data-generated-css=\"brz-css-ouvor\">Graph \u2013 breadth first traversal<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-pxush\" data-uniq-id=\"fhefp\" data-generated-css=\"brz-css-xorag\">Graph \u2013 depth first traversal (iterative)<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-cxjoa\" data-uniq-id=\"dheos\" data-generated-css=\"brz-css-ufcbf\">Graph \u2013 depth first search traversal (recursive)<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-dssjw\" data-uniq-id=\"vnngj\" data-generated-css=\"brz-css-zwkzh\">Hash table search<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-zlkzk\" data-uniq-id=\"mfuwu\" data-generated-css=\"brz-css-gofsk\">Insertion sort<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-shkjt\" data-uniq-id=\"jrxgr\" data-generated-css=\"brz-css-jlvvv\">Linear search<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-kcimx\" data-uniq-id=\"iqsxn\" data-generated-css=\"brz-css-mgklw\">Linked list with an array<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-kqsgj\" data-uniq-id=\"zowzu\" data-generated-css=\"brz-css-ecwzq\">Linked list with objects<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-slwrl\" data-uniq-id=\"qfmts\" data-generated-css=\"brz-css-gwgxh\">Merge sort (iterative)<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-oyfwc\" data-uniq-id=\"scrxq\" data-generated-css=\"brz-css-kjwwo\">Merge sort (recursive method 1)<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-tvqus\" data-uniq-id=\"rumcs\" data-generated-css=\"brz-css-ghpzk\">Merge sort (recursive method 2)<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-lytdr\" data-uniq-id=\"yisnd\" data-generated-css=\"brz-css-pmvxx\">Queue (circular) with an array<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-fwsxr\" data-uniq-id=\"otdjt\" data-generated-css=\"brz-css-jjlyq\">Quicksort (Hoare method)<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-clbbx\" data-uniq-id=\"glinf\" data-generated-css=\"brz-css-gpihr\">Quicksort (Lomuto method)<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-xoebq\" data-uniq-id=\"mtcaa\" data-generated-css=\"brz-css-yibgl\">Quicksort (Variant method)<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-oyczj\" data-uniq-id=\"rhaou\" data-generated-css=\"brz-css-fcmwp\">Stack with an array<\/li>\n<li class=\"brz-tp-lg-paragraph brz-css-lhafq\" data-uniq-id=\"thxwl\" data-generated-css=\"brz-css-ptslh\">Stack with objects<\/li>\n<\/ol>\n<p><a href=\"https:\/\/amzn.eu\/d\/160UVwr\" target=\"_blank\" rel=\"noopener\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone size-medium wp-image-62852\" src=\"https:\/\/craigndave.org\/wp-content\/uploads\/2020\/11\/amazon-logo_black-300x145.jpg\" alt=\"\" width=\"300\" height=\"145\" \/><\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p style=\"text-align: left;\">Our 232-page book provides a comprehensive in-depth guide to all the algorithms and data structures that students need to understand for GCSE and A level examinations.<\/p>\n","protected":false},"featured_media":3176,"template":"","meta":{"_acf_changed":false,"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0},"product_brand":[],"product_cat":[49,47,50,51,52,53,41,54,55,56,22],"product_tag":[],"class_list":{"0":"post-749","1":"product","2":"type-product","3":"status-publish","4":"has-post-thumbnail","6":"product_cat-aqa-a-level-7516-7517-programming-resources","7":"product_cat-aqa-a-level-paper-1","8":"product_cat-aqa-gcse-8525-paper-1","9":"product_cat-aqa-gcse-8525-programming-resources","10":"product_cat-cambridge-igcse-0478-0984-programming-resources","11":"product_cat-ocr-a-level-h046-h446-programming-resources","12":"product_cat-ocr-a-level-h046-h446-unit-2-algorithms-problem-solving-algorithms-programming","13":"product_cat-ocr-gcse-j277-programming-resources","14":"product_cat-ocr-gcse-j277-unit-2","15":"product_cat-pearson-edexcel-gcse-1cp2-programming-resources","16":"product_cat-resources","18":"first","19":"instock","20":"downloadable","21":"taxable","22":"shipping-taxable","23":"product-type-simple"},"acf":[],"aioseo_notices":[],"_links":{"self":[{"href":"https:\/\/pennstudiostaging.co.uk\/craig-n-dave\/wp-json\/wp\/v2\/product\/749","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/pennstudiostaging.co.uk\/craig-n-dave\/wp-json\/wp\/v2\/product"}],"about":[{"href":"https:\/\/pennstudiostaging.co.uk\/craig-n-dave\/wp-json\/wp\/v2\/types\/product"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/pennstudiostaging.co.uk\/craig-n-dave\/wp-json\/wp\/v2\/media\/3176"}],"wp:attachment":[{"href":"https:\/\/pennstudiostaging.co.uk\/craig-n-dave\/wp-json\/wp\/v2\/media?parent=749"}],"wp:term":[{"taxonomy":"product_brand","embeddable":true,"href":"https:\/\/pennstudiostaging.co.uk\/craig-n-dave\/wp-json\/wp\/v2\/product_brand?post=749"},{"taxonomy":"product_cat","embeddable":true,"href":"https:\/\/pennstudiostaging.co.uk\/craig-n-dave\/wp-json\/wp\/v2\/product_cat?post=749"},{"taxonomy":"product_tag","embeddable":true,"href":"https:\/\/pennstudiostaging.co.uk\/craig-n-dave\/wp-json\/wp\/v2\/product_tag?post=749"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}