February, 2016

  • 26 February

    Merge Sort in Java with examples

    Merge Sort Java

    Merge Sort is based on a divide and conquer algorithm. It is very easy to implement, and very fast sorting technique. The efficiency/performance is approximately equal to m.log (m). As the algorithm based on divide and conquer it divide an array until each divided array has only one element i.e. …

  • 25 February

    Selection Sort in Java with examples

    Selection sorting is inefficient with a large number of unsorted data. As its name selection, it does the same. It get the lowest number from the unsorted list and update the unsorted data. Selection Sort Java Algorithm:- Suppose we have an unsorted array of size n. The first time it …

  • 25 February

    Insertion Sort in Java with examples

    Insertion sorting is very similar to bubble sorting, even in worst case the running time will be same. The key concept of insertion sort is similar to arrange the playing card while player picks the 13 cards from the table and arrange those in order in hand. For example, on …

  • 24 February

    QuickSort in Java with examples

    There are so many sorting technique / algorithm like bubble sort, merge sort, selection sort, quick sort, insertion sort etc. Quicksort is the mostly used sorting algorithm in the computer world. The performance of the Quick Sort is better than bubble sorting, merge sorting. The main key point is divide …

  • 23 February

    Polymorphism in Java with examples

    Polymorphism java

    Polymorphism is one of the core concepts of any Object Oriented Programing language. Polymorphism is Latin word and its meaning is that an object having a different form like water, ice and vapor all are a form of H2O. There are two types of polymorphism in Java these are Compile …

  • 23 February

    Binary Search in Java with examples

    Binary search java 1

    In the world of computer science there are so many concepts and search is the one of the most important things. For example we have telephone directory without any index and suppose we need to find someone phone number, now can you imagine how difficult it would be? If it …

  • 23 February

    Inheritance in java with examples

    Java is Object-Oriented Programming. The core concept of OOPs programming is Encapsulation, Inheritance, Class, Object, Abstraction and Polymorphism. Inheritance is one of the main core concepts in Java. Inheritance uses to reuse the code of other class. The class which is using another class property is known as a subclass …

  • 20 February

    Bubble Sort in Java with examples

    Bubble Sort Java Algorithm:- Key Point is: Take a pair from the collection of item and compare. If they have wrong order swap them. Flow: Consider a sequence 4, 2, 3, 1 Sort in increasing order Java Bubble Sort Process:- < Outer Loop> In first loop < Sequence is 4, …

  • 20 February

    Two Dimensional Arrays in Java with Examples

    In general, Array is a collection of the elements, where elements are of same data type. They are fixed in size. Array gives the random access of the elements of an array are index based and that is the main advantage of the array. But the biggest disadvantage is, its …

  • 19 February

    Loops in Java with Examples

    Loops in java are also called iteration statements. Basically, there are three types of iterations statement in java. These are while statement do-while statement For statement Iteration statement is used when need to execute a block of statement repeatedly. All three iteration statements differ in the order in which they …