{"id":96,"date":"2014-12-25T07:37:28","date_gmt":"2014-12-25T07:37:28","guid":{"rendered":"http:\/\/theoryofprogramming.wordpress.com\/?page_id=96"},"modified":"2025-01-19T04:47:36","modified_gmt":"2025-01-19T04:47:36","slug":"theory-of-programming","status":"publish","type":"page","link":"https:\/\/theoryofcoding.com\/","title":{"rendered":"Theory of Coding"},"content":{"rendered":"\n<p>Theory of Coding (formerly &#8220;Theory of Programming&#8221;) is a very helpful website that helps you in understanding a wide range of programming concepts. There are many posts on Data Structures, Algorithms and\u00a0the Java Programming Language which explain the concepts with vivid explanations, well-drawn diagrams and also come with the actual code on the concept.<\/p>\n\n\n\n<p>Theory of Coding is also on <strong>YouTube<\/strong>! Please <a href=\"https:\/\/www.youtube.com\/channel\/UC2Q7RDQeRlmcJtZh4RnOyUg\"><strong>visit the YouTube channel<\/strong><\/a>. Hoping you&#8217;ll support the YouTube channel just like you have greatly supported the website! \ud83d\ude42<\/p>\n\n\n\n<p>Theory of Coding aims to provide free coding related tutorials to everyone. If you found this website useful, please share to support Theory of Coding!<\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Graph Theory<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"\/index.php\/2014\/12\/24\/graph-theory-basics\/\" data-type=\"link\" data-id=\"index.php\/2014\/12\/24\/graph-theory-basics\/\">Graph Theory Basics<\/a>&nbsp;&nbsp; \ud83d\udcc8 One of Top Viewed!<\/li>\n\n\n\n<li><a href=\"\/index.php\/2014\/12\/25\/graph-theory-breadth-first-search\/\">Breadth First Search (BFS) in C<\/a>&nbsp;&nbsp; \ud83d\udcc8 One of Top Viewed!<\/li>\n\n\n\n<li><a href=\"\/index.php\/2014\/12\/25\/graph-theory-snakes-and-ladders\/\">Snakes and Ladder Game by Breadth First Search (BFS)<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2014\/12\/26\/graph-theory-depth-first-search\/\">Depth First Search (DFS)<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2015\/01\/19\/bellman-ford-algorithm\/\">Bellman Ford Algorithm<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/bellman-ford-algorithm-using-cpp-stl\/\">Bellman Ford Algorithm in C++ STL<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2015\/03\/27\/prims-algorithm\/\">Prim&#8217;s Algorithm<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/prims-algorithm-using-cpp-stl\/\">Prim&#8217;s Algorithm in C++ STL<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2015\/01\/11\/graph-theory-dijkstras-algorithm\/\">Dijkstra&#8217;s Algorithm<\/a><\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Artificial Intelligence<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"\/index.php\/2017\/12\/12\/minimax-algorithm\/\" data-type=\"link\" data-id=\"\/index.php\/2017\/12\/12\/minimax-algorithm\/\">MiniMax Algorithm<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2017\/12\/24\/minimax-algorithm-with-alpha-beta-pruning\/\" data-type=\"link\" data-id=\"\/index.php\/2017\/12\/24\/minimax-algorithm-with-alpha-beta-pruning\/\">MiniMax Algorithm with Alpha-Beta Pruning<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2018\/01\/14\/iterative-deepening-depth-first-search-iddfs\/\" data-type=\"link\" data-id=\"\/index.php\/2018\/01\/14\/iterative-deepening-depth-first-search-iddfs\/\">Iterative Deepening Depth First Search (IDDFS)<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2018\/01\/21\/bidirectional-search\/\" data-type=\"link\" data-id=\"\/index.php\/2018\/01\/21\/bidirectional-search\/\">Bidirectional Search<\/a><\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Tree and Heap Data Structures<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"\/index.php\/2014\/12\/24\/binary-indexed-tree-or-fenwick-tree\/\">Binary Indexed Tree or Fenwick Tree<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2015\/01\/16\/trie-trees-2\/\">Trie Tree<\/a>&nbsp;&nbsp; \ud83d\udcc8 One of Top Viewed!<\/li>\n\n\n\n<li><a href=\"\/index.php\/trie-tree-using-cpp-class\/\">Trie Tree using C++ Class<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2015\/08\/24\/trie-tree-practise-spoj-phonelst\/\">Trie Tree Practice &#8211; SPOJ &#8211; PHONELST<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2015\/09\/01\/trie-tree-practise-spoj-dict\/\">Trie Tree Practice &#8211; SPOJ &#8211; DICT<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2016\/11\/15\/compressed-trie-tree\/\">Compressed Trie Tree or Radix Tree or Patricia Tree<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2018\/01\/14\/n-ary-tree-k-way-tree-data-structure\/\">N-ary tree or K-way tree data structure<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2015\/01\/27\/segment-trees\/\">Segment Trees<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2014\/12\/28\/binary-heaps\/\">Binary Heaps (using Arrays)<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2015\/02\/01\/more-binary-heaps\/\">Binary Heaps (using Structures) and Heapsort Algorithm<\/a><\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Dynamic Programming<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"\/index.php\/2015\/03\/02\/dynamic-programming-introduction-and-fibonacci-numbers\/\">Dynamic Programming Introduction and&nbsp;Fibonacci Numbers<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2016\/10\/21\/dynamic-programming-kadanes-algorithm\/\">Kadane&#8217;s Algorithm<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2016\/11\/06\/dynamic-programming-edit-distance\/\">Edit Distance<\/a><\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Search Algorithms<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"\/index.php\/2016\/11\/04\/binary-search-algorithm\/\">Binary Search Algorithm<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2016\/11\/10\/jump-search-algorithm\/\">Jump Search Algorithm<\/a><\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Sorting Algorithms<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"\/index.php\/2015\/01\/20\/quick-sort\/\">Quick Sort<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2015\/01\/29\/merge-sort\/\">Merge Sort<\/a><\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Java Programming Tutorials<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"\/index.php\/2015\/05\/26\/java-an-introduction\/\">An Introduction<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2015\/05\/27\/java-data-types-input-and-operators\/\">Data Types, Input and Operators<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2015\/05\/30\/java-branching-and-looping\/\">If Else, Switch and Loops<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2015\/06\/05\/java-tutorials-strings-string-buffer-builder-in-java\/\">String, StringBuffer and StringBuilder<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2015\/06\/14\/java-tutorials-arrays-in-java\/\">Arrays in Java<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2015\/06\/21\/java-tutorials-enum-and-methods-in-java\/\">Enum and Methods in Java<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2015\/08\/14\/classes-and-objects\/\">Classes and Objects<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2016\/02\/19\/encapsulation-in-java\/\">Encapsulation in Java<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2016\/03\/03\/constructor-and-overloading-methods\/\">Constructor and Overloading Methods<\/a><\/li>\n\n\n\n<li><a href=\"\/index.php\/2017\/12\/02\/inheritance-in-java\/\">Inheritance in Java<\/a><\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Math<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"\/index.php\/2014\/12\/24\/number-theory-modular-arithmetic\/\">Modular Arithmetic<\/a><\/li>\n<\/ul>\n\n\n\n<ul class=\"wp-block-list\">\n<li><\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Express your support by liking our Facebook Page!<\/h2>\n\n\n\n<p>Did Theory of Coding help you with programming..? If yes, then, express your support by liking <a href=\"https:\/\/www.facebook.com\/TheoryOfProgramming\/\" data-type=\"link\" data-id=\"https:\/\/www.facebook.com\/TheoryOfProgramming\/\">our Facebook page<\/a> and sharing it with your friends.&nbsp;Let the knowledge flow..! The more you share, the more you get..! \ud83d\ude09<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Theory of Coding (formerly &#8220;Theory of Programming&#8221;) is a very helpful website that helps you in understanding a wide range of programming [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"open","ping_status":"open","template":"","meta":{"jetpack_post_was_ever_published":false,"footnotes":""},"class_list":["post-96","page","type-page","status-publish","hentry"],"jetpack_sharing_enabled":true,"jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/theoryofcoding.com\/index.php\/wp-json\/wp\/v2\/pages\/96","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/theoryofcoding.com\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/theoryofcoding.com\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/theoryofcoding.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/theoryofcoding.com\/index.php\/wp-json\/wp\/v2\/comments?post=96"}],"version-history":[{"count":28,"href":"https:\/\/theoryofcoding.com\/index.php\/wp-json\/wp\/v2\/pages\/96\/revisions"}],"predecessor-version":[{"id":4101,"href":"https:\/\/theoryofcoding.com\/index.php\/wp-json\/wp\/v2\/pages\/96\/revisions\/4101"}],"wp:attachment":[{"href":"https:\/\/theoryofcoding.com\/index.php\/wp-json\/wp\/v2\/media?parent=96"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}