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

Semaphores In Process Synchronization

⇰ Semaphores :- Semaphore is actually a method or tool to prevent race condition. Race condition can cause loss of data or even deadlock situation. For prevention from these conditions, the semaphore is one of the method. Semaphore was proposed by Dijkstra in 1965. Simaphore is a very significant technique to manage concurrent processes. Semaphore is useful tool in the prevention of race condition. But the use of semaphore never means a guarantee that a program is free from these problems. Semaphore is an integer variable which is used in mutual exclusive manner by various concurrent cooperative processes in order to acheive synchronization. Hence semaphore is one of the way to achieve synchronization. Semaphore is basically a variable which is non-negative and shared between threads. This variable is used to solve the critical section problem and to achieve process synchronization in the multiprocess...

DeadLock In Operating System

⇰ DEADLOCK :- As we know in a multiprogramming environment several processes may compete for a finite number of resources. If a process requests resources and if the resources are not available at that time, the process enters a state called waiting state. Sometimes, a waiting process is never again able to change state or never out from waiting state, because the resources it has requested are held by or taken by other waiting processes before this process.This situation is called a Deadlock. ⇰ DEADLOCK CHARACTERIZATION:- In a deadlock processes never finish executing and system resources are tied up and also preventing other jobs from starting. Here are some features that characterize deadlocks. A deadlock situation can arrive if the following four conditions hold simultaneously in any operating system :- 1. Mutual exclusion :- A process must hold at least one resource in a nonsharable mode so tha...

Search This Blog