Quick Vs Merge Vs Heap Sort

 

 Time complexity

Quick sort  Worst Case = O(n2) Average case and best case: O(n log n)

 

Merge sort Worst case = Average Case = Best Case = O(n log n)

 

Heap Sort Worst case = Average Case = Best Case = O(n log n) 

 

 

Space complexity

Quick sort  Worst Case = O(n) Average case and best case: O( log n)

This happens when the pivot element’s correct position in the partitioned array is in the middle every time. The size of subarrays will be half the size of the original array. In this case, the recursive tree’s size will be O(log n). 

 

Merge sort Worst case = O(n) Average Case = Best Case = O( log n)

Since we use an auxiliary array of size at most n to store the merged subarray, the space complexity is O(n).

Heap sort   O(1)  Doesnt require extra space

 

 

Exception class Hierarchy

HashMap Add element Snapshot

Bubble Vs selection Vs insertion sort

Jdk8 Features used

Quick Overview of Java 8 Features Some of the important Java 8 features are;

• forEach() method in Iterable interface
• default and static methods in Interfaces
• Functional Interfaces and Lambda Expressions
• Java Stream API for Bulk Data Operations on Collections
• Java Time API
• Collection API improvements
• Concurrency API improvements
• Java IO improvements

@FunactionalInterface indicates that an interface has only 1 abstract method . It is not mandatory to use this annotation , but just to avoid accidental addition of other methods .

default and static methods in Interfaces are allowed in JDK8

forEach() method in Iterable interface - wrote a program to create new set

Java Stream API for Bulk Data Operations on Collections - write a program for implementing it