_Beginner 2 Computer Science

Heap sort is very easy to implement and its time complexity is  O(n log(n)). Sorting Max-heap: Let array S is of size n . where   ...

Priority Queue is very commonly used in operating system to schedule task, priority Queue can very easily and very effectively can impleme...

Heap is also called Left Complete binary tree. i.e Binary tree with some of rightmost node removed. It is very efficient for priority Queu...

Idea : - we are going to find factorial of a large number number. Factorial of large number store num in array such that each elem...

Queue: A queue is a linear list of element in which è   Deletion can take place at one end that is  Front . è   Insertion take...

Queue: A queue is a linear list of element in which è Deletion can take place at one end that is Front . è Insertion take pl...

Two numbers form Amicable Pairs  if sum of proper divisors of  1st is equal  to the 2nd and vice-versa.It is assumed that these two number...

• One-Dimensional Array • Two-Dimensional Array • Three-Dimensional Array • Some programming Language allows as many as 7 dimension...

Linear  Arrays • A linear array is a list of a finite number of n homogeneous data elements ( that is data elements of the same type) s...

• Data Structure : The logical or mathematical model of a particular organization of data • Storage Structure : Representation of a...

• Algorithm    Perform search for value X   If X is a leaf, delete X      Else   // must delete internal node      a) Replace with...

Suppose T is a binary tree Then T is called binary search tree if each node N of T   has the following property The value at N is ...

If a matrix contains lots of ZEROS , then to save time & space,we use a special type of matrix ,known as SPARSE MATRIX..... It store...

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...

Sorting refers to the operation of arranging data in some order such as increasing or decreasing with numerical data or alphabetically with...

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