Introduction
Can sorting be made faster? We have seen sorting techniques like (Insertion Sort, Selection Sort and Shell Sort) which have a quadratic running time. With growing size of the inputs, it becomes tough to use these algorithms. Is there any faster alternative? We would like to find answers to these questions in the Merge Sort article.
On the other hand if you are interested in watching a video for this article, you can subscribe our Youtube Channel.
Purpose of the Article
In this article we try to answer the questions mentioned above. Yes there are many faster alternatives....

Read More
# data structures and algorithm

## How selection sort works – A detailed explanation

Introduction
Probably the most crude sorting technique, and also the most in-efficient one. But it's important, because until we know the worst we can't understand the importance of the good and the better. So let us try to find out, how selection sort works.
Purpose of the article
We will try to understand here, how selection sort works and how is the nature of input affecting the running time of this algorithm. Why this is a crude way of sorting and its advantages and dis-advantages.
Idea behind Selection Sort
As the name suggests, there is definitely something to select. Lets assume we...

Read More
## Basics of Shell Sort

Introduction
This article can be considered as the continutation of the article explaining Insertion Sort. To have a quick look please visit Insertion Sort. In this article we will learn how to over come the limitations of Insertion Sort by understanding the Basics of Shell Sort. You can also consider Shell Sort to be an improvement over Insertion Sort.
Purpose of the article
To understand the Basics of Shell Sort and compare it with insertion sort. We will also write code snippets and pseudo codes to understand it better.
Idea behind Shell Sort
The biggest limitation of Insertion Sort i...

Read More
## Analysis of Algorithms Made Easy

Introduction
This article presents a better approach to understand how to analyze algorithms. Moreover, we would like to understand what algorithms are and why are they important. This is the first article in the series Analysis of Algorithms Made Easy. I have dedicated a separate page for the same and you can get the list of all the articles in this series here.
Purpose of the article
In this article we will just try and understand the idea behind analyzing algorithms. It would be be more likely a Question and Answer article.
What is an algorithm ?
Answer: It's a theoretical study of co...

Read More
## Easy way to understand quick sort

Introduction
This article touches in detail all the aspects of a quick sort algorithm. I tried to write it as simple as possible to make it an easy way to understand quick sort. This is really an interesting algorithm to learn and I have found that most of the students or professionals feel it hard to understand or re-produce in code.
Problem Statement
You are given an array A[a1,a2,a3, . . . . . . , an] having elements in a random order and we need to re-produce the array A[b1, b2, b3, . . . . , bn] where b1 < b2 < b3 < b4 < . . . < bn .
Basic idea behind quick sort
The ba...

Read More
## Merging two Sorted Singly Linked List

Introduction - Merging two Sorted Singly Linked List
This question is mostly asked in interviews and hence I thought of writing few possible solutions to the same. I also asked the same question on stackoverflow.com. You can visit the link here
Problem Statement
You have two singly linked lists that are already sorted, you have to merge them and return the head of the new list without creating any new extra nodes. The returned list should be sorted as well
The method signature is:
[crayon-59951028bd8f2304296104/]
Node class is below:
[crayon-59951028bd8ff697179080/]
Solution
There c...

Read More