#
Data Structure Archive

In this post, we will see about Doubly LinkedList implementation in java. We have already seen the implementation of singly linked list. You can consider this as an extension of Singly linked list.It is quite …

Last updated on March 14th, 2017 at 10:05 amIn this post, we will see about trie data structure in java. What is Trie : Trie is data structure which stores data in such a way …

Last updated on March 14th, 2017 at 12:49 pm If you want to practice data structure and algorithm programs, you can go through data structure and algorithm interview questions. We have already seen about breadth first …

Last updated on March 14th, 2017 at 12:48 pm If you want to practice data structure and algorithm programs, you can go through data structure and algorithm interview questions. In previous post, we have seen breadth …

Last updated on August 22nd, 2017 at 11:58 pmShell sort is in place comparison based sorting algorithm. It is generalization of insertion sort. It was invented by Donald shell. It allows to sort elements which …

Last updated on August 22nd, 2017 at 11:59 pmCounting sort is special sorting technique used to sort elements between specific range. Lets say elements belong to range 1 to K , then Counting sort can …

Last updated on March 14th, 2017 at 10:25 amIn this post, we will see how to implement heap sort in java. I will divide heap sort in multiple parts to make it more understandable. What …

Last updated on August 22nd, 2017 at 11:59 pmQuicksort or partition-exchange sort, is a sorting algorithm, which is using divide and conquer algorithm. In quick sort, we first choose a pivot and divide into two …

Last updated on August 22nd, 2017 at 11:59 pm If you want to practice data structure and algorithm programs, you can go through data structure and algorithm interview questions. Merge sort is divide and conquer sorting …

Last updated on August 22nd, 2017 at 11:58 pmSelection sort is an in place comparison sorting algorithm. It is very simple to implement but it does not go well with large number of inputs. Selection …