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
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.
Java Binary Search with Comparator is very flexible method to search for elements of any type. In this tutorial you will learn how to use binary search in Java with own Comparator!
Java binary search is very fast way to find an element in a sorted collection of elements or find a place where it should be inserted. In this tutorial you will learn how to effectively use binary search in Java!
How to find Fibonacci numbers in Java?
How to write Fizz Buzz in Java?
The problem is as follows:
Write a program that prints the numbers from 1 to 100. But for multiples of three print ‘Fizz’ instead of the number and for the multiples of five print ‘Buzz’. For numbers which are multiples of both three and five print ‘FizzBuzz’.
It’s a very common task on job interviews.