## PROGRAM FOR HEAP SORT IN C IN DEPTH – SHOUT CODERS

WHAT IS A HEAP? It is a binary tree with the following properties: Property 1: it is a complete binary tree Property 2: the value stored at a node is greater or equal to the…

Comment

## DIVIDE & CONQUER ALGORITHM | QUICK SORT – SHOUT CODERS

Divide and Conquer is an algorithmic pattern. In algorithmic methods, the design is to take a dispute on a huge input, break the input into minor pieces, decide the problem on each of the small…

Comment

## DIVIDE & CONQUER ALGORITHM | MERGE SORT – SHOUT CODERS

Divide and Conquer is an algorithmic pattern. In algorithmic methods, the design is to take a dispute on a huge input, break the input into minor pieces, decide the problem on each of the small…

Comment

## ACTIVITY SELECTION PROBLEM – SHOUT CODERS

The Activity Selection Problem is an optimization problem which deals with the selection of non-conflicting activities that needs to be executed by a single person or machine in a given time frame.Each activity is marked…

Comment

## TOWER OF HANOI – SHOUT CODERS

The Tower of Hanoi is a mathematical game or puzzle. It consists of three rods and a number of disks of different sizes, which can slide onto any rod. The puzzle starts with the disks…

Comment

## MATRIX MULTIPLICATION – BEAUTIFUL ALGORITHM – SHOUT CODERS

MATRIX MULTIPLICATION RULE: For matrix multiplication, the number of columns in the first matrix must be equal to the number of rows in the second matrix. The result matrix has the number of rows of…

Comment

## SHORTEST JOB FIRST SCHEDULING | PREEMPTIVE & NON PREEMPTIVE – SHOUT CODERS

This program is to implement CPU scheduling algorithm for shortest job first scheduling. SJF is the short form of Shortest Job First scheduling algorithm. In this scheduling we consider shortest burst time. Process with shortest…

Comment

## FIRST COME FIRST SERVE SCHEDULING WITH & WITHOUT ARRIVAL TIME – SHOUT CODERS

This program is to implement CPU & scheduling algorithm for first come first serve scheduling. That is, First process can execute directly, Second process can execute after completion of first process, and so on. Waiting…

Comment

## BUBBLE SORT ASCENDING & DESCENDING ORDER | SHOUT CODERS

TIME COMPLEXITY OF BUBBLE SORT > Bubble sort has a worst-case and average complexity of О(n2), where n is the number of items being sorted. When the list is already sorted (best-case), the complexity of…

Comment

## LINEAR SEARCH – SHOUT CODERS

In computer science, a linear search or sequential search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole…

Comment