/tags/java/ Recent content in Java on Hugo -- gohugo.io Fri, 27 Apr 2018 19:23:31 +0000 /undertow-rest-api/ Fri, 27 Apr 2018 19:23:31 +0000 /undertow-rest-api/ Part of my daily routine is to consume, design and deliver services built for HTTP clients. This might manifest in something special like WebSocket, Protobuf but most often a plain JSON REST API. In any case, the performance is key, and an Undertow REST API with JAX-RS can deliver a stable performance under consistent load. In this article, I will cover some basics for setting up and deploying a REST API with Undertow, in Docker. /heapsort-algorithm-java/ Thu, 01 Dec 2016 19:33:49 +0000 /heapsort-algorithm-java/ 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 structure is improving the time complexity. In a nutshell, heap is a special type of tree, where the elements in the tree are in a certain order to each other. This allows to find the minimum or maximum of binary heap in O(1) and insertion/deletion in O(log(n)). /merge-sort-algorithm-java/ Wed, 16 Nov 2016 19:39:52 +0000 /merge-sort-algorithm-java/ 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), which means in this case, that the original collection is divided into smaller chunks. This idea can be implemented in a recursive fashion, so that the collection is divided into single elements and then re-constructed into a sorted collection. /bubble-sort-algorithm-java/ Mon, 14 Nov 2016 19:45:58 +0000 /bubble-sort-algorithm-java/ 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 element positions are switched on the comparison result, and the element is shifted to the correct location. This implies, that each element has to be checked against each other. This results in n*n comparisons, even if the collection is in order.