_Beginner 2 Computer Science

Finding first and last occurrence of given number in sorted list is a very easy problem and can easily solved by leaner search with worse c...

Quick select is one of very popular algorithm used to find k'th largest element in a list. It can be use to find median or finding k...

One Of very commonly asked problem in Job Interviews is To find number of occurrence of given word in given paragraph . This very easy q...

Insertion Sort is one of easiest & efficient way to sort small group of numbers . Using Python this algorithm is very very simple to im...

There are many way to sort a list using quick sort concept .i.e recursive way & iterative way. quick sort  Recursive Approach cho...

Suppose an array A with N elements is in memory. Selection sort works as follows First find the smallest element in the list and put it i...

insertion like cards An array A with N elements A[1], A[2] … A[N] is in memory Insertion Sort scan A from A[1] to A[N] inserting ea...

Quick sort is an algorithm of the divide-and-conquer type The problem of sorting a set  is reduced to the problem of sorting two smaller ...

The oldest and simplest sort in use. Unfortunately, also the slowest. Works by comparing each item in the list with the item next to it...

In previous discussion we discus about Binary search tree  Now we have to do some basic operation on binary search tree. Searching a elem...

Suppose the array A containing  8 elements {5, 2, 4, 7, 1, 3, 2, 6 }. How it will be sorted see this image. Merge Sort download thi...

It is simplest method of sorting.In this first we compare 0th element to all other element & swap values if any element found to be gre...

 THis method is very fast & efficient. this method require element in list be  in sorted  order.    In this metod we compare it wit...

Bubble sort, is a simple sorting algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair of adjacen...