Heap Sort In Data Structure

⇰ HEAP SORT :-

Heap sort is also a type of sorting technique, which can apply in binary tree sorting. Heap sort technique is comparison based sorting technique based on Heap data structure. This technique is similar to the selection sort . But first of all we need to know about Heap data structure. A Binary Heap is a Complete Binary Tree where items are stored in a special order such that root node is compared with its children and arranged accordingly. The heap is of two types:- Min heap ( value of root node is less than or equal to child) , Max heap ( value of root node is greater or equal to child). The heap can be represented by binary tree or array.

⇰ ALGORITHM HEAP SORT :-

Step1 :- Write root in the list.

Step2 :- Write last element at the root.

Step3 :- Heapify the tree.

Step4 :- Repeat all three steps.

⇰ IMPLEMENTATION OF HEAP SORT :-

Let us take a heap:-

We take element and put into list

Share, Follow and please comment if you find anything incorrect or to share more information about the topic discussed above

Comments

Process Scheduling And Types of Process Schedular :-

⇰ PROCESS SCHEDULING Process Scheduling is a task of Operating System that schedules processes of different states like new, ready, waiting, terminated and running.This scheduling helps in allocation of CPU time for each process, and Operating System allocates the CPU time for each procss. And the process scheduling plays important role to keep the CPU busy all the time. ⏩ Followings are some objectives of Process Scheduling :- i > To increase the amount of users within acceptable response times. ii > To maintain the balance between response and utilization of system. iii > To decrease the enforce priorities and give reference to the processes holding the key resources. ⇰ PROCESS SCHEDULAR A scheduler carries out the pro cess scheduling work. Schedulers are often implemented so they keep all computer resources busy and allows multiple users to share system resources to achieve multiprogramming . There are mainy three types of pro

Tokens and its types in 'C'

Tokens are the smallest individual unit of a program or in simple words it is a main part of C program.Tokens are the building blocks of any program. The smallest individual and basic unit of a C programming is called c tokens. * Normally there are six types of tokens in C:- i> Keywords:- Keywords are special words that are used to give a special meaning to the program and can't be used as variable and constant.They are basically a sequence of characters that have fixed to mean. For example:- auto double long break float short char if while continue int void etc. All keywords must be written in lower case.It is 32 in number. ii> Identifiers:- The identifiers are basically a token. It can be a variable's name or a label's name. So identifiers are actually a user defined data. But there are certain rules to frame an identifier. They are as follo

Process & Its state And process control block :-

⇰ PROCESS :- A process can be thought of as a program in execution. Means when any program is executed it becomes process. A processwill need certain resources such as CPU time , memory, files and I/O devices to complete its task. These resources are allocated to the process either when it is created or at the time of execution. A process is the unit of work in most systems. A system consistes of a collection of processes. All these processes may execute concurrently. Traditionally a process contained only a single thread. Most modern operating ststems now supports processes that have multiple threads. The operating system is responsible for several important works of process management as - the creation and deletion of process, the schrduling of process, communication and deadlock handling of process. Process is broudly divided into two types:- i> System Process. ii> User Process. Early computers allowed only one program be ex

Search This Blog