by Peter | Dec 1, 2016 | Data Structures & Algorithms, Java, Notes

HeapsortÂ algorithm details: Worst-case Time Complexity: O(n log(n)) Space Complexity: O(1) The algorithm The heapsort algorithm is an in-place, comparison based sorting algorithm. In the core of the algorithm (as the name suggest), the use of the heap data...
by Peter | Nov 16, 2016 | Data Structures & Algorithms, Java, Notes

Merge sort algorithm details: Worst-case Time Complexity: O(n log(n)) Space Complexity: O() The algorithm Merge sort is comparison based algorithm, from the efficient sorting category. The algorithm is based on “Divide and conquer” (John Van Neumann),...
by Peter | Nov 14, 2016 | Data Structures & Algorithms, Java, Notes

Algorithm details: Worst-case Time Complexity: O(n^2) Space Complexity: O(1) The algorithm Bubble sort is a very simple sorting algorithm, with straight forward implementation. The algorithm is based on comparison of all elements to each other. The compared...
by Peter | Sep 22, 2016 | Cassandra

I upgraded my Ubuntu 14.04 development system to 16.04 in August with the first point release. I have to say the upgrade process when really smooth. There where small issues with PHP and Python. The only painful issue I had was with Cassandra and CqlSh. The python...
by Peter | Sep 18, 2016 | Golang

I am always really excited reading peoples notes about new languages and technologies, and this was not different with Golang. I read about the language and an implementation roughly 4 years ago. After reading the article I looked around to find more details about the...