Insertion Sort

Insertion sort is an efficient algorithm for sorting a small number of elements, however, it is less efficient on large lists than more advanced sorting algorithms. On the other hand, it has several advantages which are;

Bubble Sort

Bubble sort is one of the simplest sorting algorithm which pairs are repeatedly compared and swapped if they are in wrong order. This process continues until no swaps are needed means that list is sorted. It takes its name from the fact that necessary elements bubble up to their correct position. Even though bubble sort shows a great performance over small input size, it has a poor performance when the input size grows. It is fast when array is in sorted order or nearly sorted. On the other hand, its worst case performance is \( O(n^{2}) \) if the array is in reversed order.

Jersey Client Example with JSON Support

In this tutorial we will implement a Jersey client example with JSON support. The tools and technologies that I have used are;

RESTEasy example without using a web.xml

In this tutorial we will implement a simple web service with RESTEasy implementation -it’s an implementation of the JAX-RS specification by JBoss- without using a web.xml file. I’ve used

mongoexport query with using date

Sometimes we might want to export only a specific part of our collection with query support of mongoexport.

Suppose this is our notebook collection, and each document refers to a notebook with their production date.