Apna Coding Adda

  Binary search is a efficient way to find element from sorted array , It works on decrease and conquer method.......

 Let's move to doubly linked list , so in this post we're gonna talk about doubly linked list. it has previous , value and next in Node...

Quick Sort: It's basically works on divide and conquer method, choose pivot as first node,last ,middle and make partition and swap values.

 Merge Sort , so merge sort divide linked list into smaller part and sort and merge those parts in one linked list, let's see how?

Let's see How Insertion sort work on linked list. In This Post we're gonna talk about Insertion Sort for singly linked list.

 When It's comes to sorting Linked list , it is not preferred to use Bubble sort, Because it is too Slow. but just for learning purpose we will take a look on Bubble Sort.

Singly Linked List : So In this post we're gonna talk about implementation of singly linked list using Python and also implementation of some basic operation on linked list...