In this post we show how to implement GCD in Java using Euclidean Algorithm. GCD is known as Greatest Common Divisor/Factor/Measure, Highest Common Divisor/Factor.

Continue reading GCD in Java using Euclidean Algorithm# algorithms

We show how to remove duplicates from List in Java. Choose implementation depending on circumstances and with expected performance.

Continue reading Remove duplicates from List in JavaInsertion sort in Clojure can be implemented in different ways. In this post we compare implementations with and without Clojure transients.

Continue reading Insertion Sort in ClojureQuicksort is one of the fastest sorting algorithms. In this article we implement Quicksort in Java, describe how it works and its properties.

Continue reading Quicksort in JavaGraphs are fundamental data structure that help to solve many algorithmic problems. In this post we show different graph representations and their properties.

Continue reading Graph representationIn this post we’ll implement Merge Sort in Java. It’s fast, divide and conquer, sorting algorithm that can also be parallelized.

Continue reading Merge Sort in JavaBubble Sort is a sorting algorithm that repeatedly goes through an array and swaps adjacent elements that are not in order. In this post we’ll show how to implement it.

Continue reading Bubble Sort in JavaTowers of Hanoi is a well known puzzle, very often used to teach recursion. In this post we will show how to solve this puzzle recursively.

Continue reading Towers of Hanoi recursive versionTop 10 sites to practice programming

Continue reading Top 10 sites to practice programmingPrime numbers – Sieve of Eratosthenes A prime number is a natural number with only two divisors: 1 and itself. In this post we’re going to show how to find prime numbers using Sieve of Eratosthenes and explain how it works.

Continue reading Prime numbers – Sieve of Eratosthenes in Java