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.
Insertion Sort in Java
Insertion Sort is another simple to understand and implement algorithm. Unlike Selection Sort it can work faster with certain data.
Selection Sort in Java
Selection Sort is one of many sorting algorithms, but unlike a few others it is easy to understand and implement as we’re going to show here!
Binary Search algorithm in Java
Binary Search is the fastest algorithm for finding an element in a sorted list. Also it’s easy to implement what we’re going to show in this post.