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.
Remove duplicates from List in Java
We show how to remove duplicates from List in Java. Choose implementation depending on circumstances and with expected performance.
Insertion Sort in Clojure
Insertion sort in Clojure can be implemented in different ways. In this post we compare implementations with and without Clojure transients.
Quicksort in Java
Quicksort is one of the fastest sorting algorithms. In this article we implement Quicksort in Java, describe how it works and its properties.
Graph representation
Graphs are fundamental data structure that help to solve many algorithmic problems. In this post we show different graph representations and their properties.
Merge Sort in Java
In this post we’ll implement Merge Sort in Java. It’s fast, divide and conquer, sorting algorithm that can also be parallelized.
Bubble Sort in Java
Bubble 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.
Towers of Hanoi recursive version
Towers 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.
Top 10 sites to practice programming
Prime numbers – Sieve of Eratosthenes in Java
Prime 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.
