C program to implement Max-Heap Sort

-

Simple C program to implement Max-Heap Sort Algorithm

Code:

#include <stdio.h>

#include <conio.h>

int main()

{

int HeapSize, i, j, c, root, temp;

 

printf("Enter The Size of the Heap :");

scanf("%d", &HeapSize);

int A[HeapSize];

printf("Enter the Elements in Heap :\n ");

for (i = 0; i < HeapSize; i++)

{

scanf("%d", &A[i]);

}

for (i = 1; i < HeapSize; i++)

{

c = i;

do

{

root = (c-1)/ 2;

if (A[root] < A[c])

{

temp = A[root];

A[root] = A[c];

A[c] = temp;

}

c = root;

} while (c != 0);

}

printf("The Heap changed into max heap is: ");

for (i = 0; i < HeapSize; i++)

{

printf("%d\t ", A[i]);

}

}


Comments

Post a Comment

Popular posts from this blog

C program to evaluate Prefix Expression using Stack data structure

-
Simple C program to evaluate Prefix Expression using Stack data structure Code: #include<stdio.h> #include<conio.h> #include<string.h> int steck[10]; int top=-1; void push(int value) { steck[top++]=value; } int pop() { return(steck[top--]); } int ope(char c) { if(c=='+'||c=='-'||c=='*'||c=='/') return 1; else return 0; } void main() { char prefix[10]; int len,val,i,opr1,opr2,res; clrscr(); printf("Enter the prefix Expression: "); scanf("%s",prefix); len=strlen(prefix); for(i=len-1;i>=0;i--) { switch(ope(prefix[i])) { case 0: val=prefix[i]; push(val); break; case 1: opr1=pop(); opr2=pop(); switch(prefix[i]) { case '+': res=opr1+opr2; break; case '-': res=opr1-opr2; break; case '*': res=opr1*opr2; break; case '/': res=opr1/opr2; break; } push(res); } } printf("Result is %d",steck[top]); getch(); }
Read more

Servlet Program to Print Today’s Date and Time using refresh header

-
Simple Java Servlet Program to Print Date and Time using refresh header (Time updates automatically) Code: import java.io.*; import javax.servlet.*; import javax.servlet.http.*; import java.util.Date; public class servlet2 extends HttpServlet { public void doGet(HttpServletRequest req, HttpServletResponse rsp) throws ServletException, IOException { rsp.setIntHeader("Refresh", 1); rsp.setContentType("text/html"); PrintWriter out = rsp.getWriter(); Date now = new Date(); out.println("<html>"); out.println("<head><title> Time Check </title></head>"); out.println("<body>"); out.println("<p text-align=auto>Current Time: " + now + "</p>"); out.println("</body></html>"); } }
Read more

Java Program to Implement sorting algorithm using TCP on Server application

-
Simple Java program to Implement sorting algorithm using TCP on Server application Input: Give input on client side and client should receive sorted output from server and display sorted list on input(client) side. Note: You can implement any sorting algorithm by changing the sorting algorithm code on server side Code: Server: package aj.pkg7; import java.io.*; import java.net.*; import java.util.*; class Server { public static void main(String args[]) throws Exception { ServerSocket ss=new ServerSocket(1111); Socket s=ss.accept(); DataInputStream din=new DataInputStream(s.getInputStream()); DataOutputStream dout=new DataOutputStream(s.getOutputStream()); int r,i=0; int n=din.readInt(); int a[]=new int[n]; System.out.println("data:"); int count=0; for(i=0;i<n;i++) { a[i]=din.readInt(); } int number = a.length; for (int i1 = 0; i1 < number-1; i1++) for (int j1 = 0; j1 < number-i1-1; j1++) if (a[j1] > a[j1+1]) { int temp = a[j1]; a[j1] = a[j1+1]; a[j1+1] = temp; } ...
Read more