In our previous article Stack Introduction and Implementation we had learnt how to implement stack in java. In this first example we will see how to reverse a word or a string using a stack. When you run the following code, it… Read More!
Stack is more abstract entity than array and many other data structures. The underlying mechanism used to implement stacks is not visible to the user. It follows Last In First Out (LIFO) principle i.e., stacks allows access to only one… Read More!
Are you getting NullPointerException while using Arrays.sort() and Comparable and don’t know exactly where is the problem in your code ? Solution You may get this exception when you miss any element or something is null. Check the following example,… Read More!
In our Java program below we use insertion sort to sort Student objects based on the lastName key values. The doInsertionSort() method in this example is similar to doInsertionSort() method in the insertion sort example, but the only difference is we… Read More!
Insertion sort consumes or marks one element in each iteration from the array of elements and grows the sorted output list. At each iteration, insertion sort removes one element from the input array and insert that element in a location… Read More!
