Tag: data structures in java

Array Rotation in Java

Array Rotation in Java. (Asked by top MNC's like Amazon, Microsoft, goldman sachs, wipro, TCS..etc)

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.

Count the node of linked list in Java

In this post we will be Count the node of linked list in Java. Given a singly linked list. The task is to find the length of the linked list, where length is defined as the number of nodes in the linked list.