ProjectsProgramming book reviews, programming tutorials,programming news, C#, Ruby, Python,C, C++, PHP, Visual Basic, Computer book reviews, computer history, programming history, joomla, theory, spreadsheets and more.
http://www.i-programmer.info/projects/61.html
Wed, 25 May 2016 03:23:50 +0000Joomla! 1.5 - Open Source Content Managementen-gbThe Minimum Spanning Tree - Prim's Algorithm
http://www.i-programmer.info/projects/61-algorithms/534-minimum-spanning-tree.html
http://www.i-programmer.info/projects/61-algorithms/534-minimum-spanning-tree.htmlFinding the minimum spanning tree is one of the fundamental algorithms and it is important in computer science and practical programming. We take a look at the theory and the practice.
]]>mike.james@infomaxgroup.co.uk (Mike James)AlgorithmsThu, 25 Feb 2016 00:00:00 +0000The Knapsack Problem
http://www.i-programmer.info/projects/61-algorithms/554-the-knapsack-problem.html
http://www.i-programmer.info/projects/61-algorithms/554-the-knapsack-problem.htmlI like problems that look simple and turn out to be really difficult. It's the way that something simple can hide a complexity that you never guessed at. Fortunately for me the universe seems to be built in this way! One particularly fascinating problem, that also has applications in cryptography, is the knapsack or sum partitioning problem.
]]>mike.james@infomaxgroup.co.uk (Mike James)AlgorithmsTue, 01 Jul 2014 00:00:00 +0000QuickSort Exposed
http://www.i-programmer.info/projects/61-algorithms/690-quick-sort-exposed.html
http://www.i-programmer.info/projects/61-algorithms/690-quick-sort-exposed.htmlThe QuickSort is the most elegant of algorithms and every programmer should study it. It is not only elegant, it is subtle and this often means it is incorrectly implemented and incorrectly explained. Let's find out how it works and how to get it right.
]]>mike.james@infomaxgroup.co.uk (Mike James)AlgorithmsMon, 01 Jul 2013 00:00:00 +0000