Scribd Logo
Hochladen

Willkommen bei Scribd!

  • DAA 214 Heap Sort Algorithms

    Hochgeladen von

    Gamindu Udayanga
    21 Ansichten3 Seiten
    This document contains code and instructions for heap sort algorithms. It discusses reading a set of numbers into an array, and then using a max-heapify algorithm and a build-max-heap algorithm to sort the array and maintain the heap property. The max-heapify algorithm exchanges elements to ensure the root node is the largest. The build-max-heap algorithm calls max-heapify to build the heap from the array.

    Originalbeschreibung:

    Originaltitel

    DAA_Lab08Student.ppt

    Copyright

    © © All Rights Reserved

    Verfügbare Formate

    PPT, PDF, TXT oder online auf Scribd lesen

    Stufen Sie dieses Dokument als nützlich ein?

    Sind diese Inhalte unangemessen?

    Dieses Dokument melden
    This document contains code and instructions for heap sort algorithms. It discusses reading a set of numbers into an array, and then using a max-heapify algorithm and a build-max-heap algorithm to sort the array and maintain the heap property. The max-heapify algorithm exchanges elements to ensure the root node is the largest. The build-max-heap algorithm calls max-heapify to build the heap from the array.

    Copyright:

    © All Rights Reserved
    Als PPT, PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    21 Ansichten3 Seiten

    DAA 214 Heap Sort Algorithms

    Hochgeladen von

    Gamindu Udayanga
    This document contains code and instructions for heap sort algorithms. It discusses reading a set of numbers into an array, and then using a max-heapify algorithm and a build-max-heap algorithm to sort the array and maintain the heap property. The max-heapify algorithm exchanges elements to ensure the root node is the largest. The build-max-heap algorithm calls max-heapify to build the heap from the array.

    Copyright:

    © All Rights Reserved
    Als PPT, PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    von 3

    Design and Analysis of Algorithms 214.

    Introduction to the C Programming Language.

    Heap sort Algorithms.

    U.U.Samantha Rajapaksha
    B.Sc.(Eng.)

    Sri Lanka Institute of Information Technology.


    Samantha.r@sliit.lk
    0112301904

    DAA 214 Sri Lanka Institute of Information Technology.


    Exercise 09.
     Write a program to read a set of numbers and store them on an array. Then
    using the following psedocode for heapify algorithm maintain the heap property
    for the root node.

    MAX-HEAPIFY(A, i)

    1 l ← LEFT(i)
    2 r ← RIGHT(i)
    3 if l ≤ heap-size[A] and A[l] > A[i]
    4 then largest ← l
    5 else largest ← i
    6 if r ≤ heap-size[A] and A[r] > A[largest]
    7 then largest ← r
    8 if largest ≠ i
    9 then exchange A[i] ↔ A[largest]
    10 MAX-HEAPIFY(A, largest)

    DAA 214 Lab 02 Sri Lanka Institute of Information Technology.


    Exercise 10.
     Modify the previous program in exercise 09 with
    Buildheap algorithm given below to build a heap.

    BUILD-MAX-HEAP(A)
    1 heap-size[A] ← length[A]
    2 for i ← ⌊length[A]/2⌋ downto 1
    3 do MAX-HEAPIFY(A, i)

    DAA 214 Lab 02 Sri Lanka Institute of Information Technology.

    Das könnte Ihnen auch gefallen