Apurva Dsa 10

NAME=Apurva thorat
ROLL NO=1259
public class HeapSort<T extends Comparable<T>> {
private T data[];
private int length;
HeapSort(T data[]) {
this.data = data;
this.length = this.data.length;
public T[] buildMaxHeap(T[] tempData) {
for(int i = (int) Math.floor(length/2); i >= 0 ; i--) {
tempData = heapify(tempData, i);
return tempData;
public T[] heapify(T[] tempData, int node) {
int leftNode = node*2+1;
int rightNode = node*2+2;
int maxNode = node;
if(leftNode < length) {
if(tempData[leftNode].compareTo(tempData[maxNode]) > 0){
maxNode = leftNode;
if(rightNode < length) {
if((tempData[rightNode].compareTo(tempData[maxNode])) > 0) {
maxNode = rightNode;
}
if(maxNode != node) {
T temp = tempData[node];
tempData[node] = tempData[maxNode];
tempData[maxNode] = temp;
tempData = heapify(tempData, maxNode);
return tempData;
public void sort(){
this.data = buildMaxHeap(this.data);
while(length > 0) {
this.length--;
T temp = this.data[0];
this.data[0] = this.data[length];
this.data[length] = temp;
this.data = heapify(this.data, 0);
public void printData() {
for(T i : this.data) {
System.out.print(i + " ");
System.out.println();
public static void main(String[] args) {
String[] dataToBeSorted = {"lalu", "vivek", "kia", "priya", "jui"};

HeapSort heapSort = new HeapSort<String>(dataToBeSorted);
System.out.println("Given Data - ");
heapSort.printData();
heapSort.sort();
System.out.println("Sorted Data - ");
heapSort.printData();
OUTPUT=
Given Data -
lalu vivek kia priya jui
Sorted Data -
jui kia lalu priya vivek
=== Code Execution Successful ===

Apurva Dsa 10

Uploaded by

Document Informationclick to expand document information

Document Informationclick to expand document information

Copyright:

Available Formats

Apurva Dsa 10

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Apurva Dsa 10

Uploaded by

Copyright:

Available Formats

NAME=Apurva thorat

public class HeapSort<T extends Comparable<T>> {

private int length;

public T[] buildMaxHeap(T[] tempData) {

for(int i = (int) Math.floor(length/2); i >= 0 ; i--) {

tempData = heapify(tempData, i);

public T[] heapify(T[] tempData, int node) {

int leftNode = node*2+1;

int rightNode = node*2+2;

int maxNode = node;

if(leftNode < length) {

if(tempData[leftNode].compareTo(tempData[maxNode]) > 0){

if(rightNode < length) {

tempData = heapify(tempData, maxNode);

public void sort(){

this.data = heapify(this.data, 0);

public void printData() {

System.out.print(i + " ");

public static void main(String[] args) {

String[] dataToBeSorted = {"lalu", "vivek", "kia", "priya", "jui"};

System.out.println("Given Data - ");

System.out.println("Sorted Data - ");

=== Code Execution Successful ===

You might also like