Warning: Use of undefined constant fixed - assumed 'fixed' (this will throw an Error in a future version of PHP) in /home/webtro13/domains/farenda.com/public_html/wp-content/themes/moments/header.php on line 65

## Maven dependency to local JAR

Did you ever need to configure Maven dependency to local JAR? It’s rarely needed, but when it is, it’s good to know how to do that correctly.

Share with the World!

## Caesar cipher in Java

One of the simplest cryptographic algorithms is Caesar cipher. It’s not really secure, but sometimes you may encounter it in some exercises or crackmes.

Share with the World!

## Linked List – remove element

As many other algorithms in Linked Listremove element from given position runs in linear time. Here we are going to implement it to better understand how it works.

Share with the World!

## Linked List – insert element at position

In this post we’ll implement another algorithm for Linked List – insert element at position. The algorithm works in linear time in the worst case.

Share with the World!

Linked List is a simple data structure. Implementing it from scratch helps to understand its properties. We’ll implement Linked List add, size, and print its contents.

Share with the World!

## Floyd Cycle detection in Java

One of the best known algorithms to detect a cycle in a linked list is Floyd Cycle detection. Using Floyd’s algorithm we can detect cycle, its beginning, and length.

Share with the World!

## Palindrome detector in Java

Palindrome is a sequence of chars which reads the same backward and forward. Detecting palindrome is a common job interview task therefore we’ll show how to implement that.

Share with the World!

## Shuffle Algorithm in Java

Shuffling of arrays/lists sounds like a trivial task, but in reality it’s full of subtle traps. Here we show how to implement Fisher-Yates Shuffle Algorithm in Java.

Share with the World!

## Parallel Merge Sort in Java

Divide and Conquer algorithms are great subject for parallelism. Here we present Parallel Merge Sort implemented using Java ForkJoin Framework.

Share with the World!

## GCD in Clojure using Euclidean algorithm

In this post we’re going to implement calculation of Greatest Common Divisor GCD in Clojure using Euclidean algorithm for two and more numbers.

Share with the World!
Pages:123