How to build the NodeJs app from scratch!

This is a small, hopefully fun introduction to a concept of Docker and Docker file.

Merge Sort in Java

Like QuickSort, Merge Sort also divide and conquer algorithm. It divides input array in two halves, calls itself for the two halves and then merges the two sorted halves. The merge() function is used for merging two halves. The merge(arr, left, mid, right) is key process that assumes that arr[left..mid] and arr[mid+1..right] are sorted and merges the two sorted sub-arrays into one.

Recursion in Java

In this post we will be seeing What is Recursion in Java. Recursion is a part of algorithms in which function calling itself until some base condition is not occur.