Heap Sort Program using C++

```
#include <iostream>
```
```
#include <conio.h>
```
```
using namespace std;
```
```
void max_heapify(int *a, int i, int n)
```
```
{
```
```
    int j, temp;
```
```
    temp = a[i];
```
```
    j = 2*i;
```
```
    while (j <= n)
```
```
    {
```
```
        if (j < n && a[j+1] > a[j])
```
```
            j = j+1;
```
```
        if (temp > a[j])
```
```
            break;
```
```
        else if (temp <= a[j])
```
```
        {
```
```
            a[j/2] = a[j];
```
```
            j = 2*j;
```
```
        }
```
```
    }
```
```
    a[j/2] = temp;
```
```
    return;
```
```
}
```
```
void heapsort(int *a, int n)
```
```
{
```
```
    int i, temp;
```
```
    for (i = n; i >= 2; i--)
```
```
    {
```
```
        temp = a[i];
```
```
        a[i] = a[1];
```
```
        a[1] = temp;
```
```
        max_heapify(a, 1, i - 1);
```
```
    }
```
```
}
```
```
void build_maxheap(int *a, int n)
```
```
{
```
```
    int i;
```
```
    for(i = n/2; i >= 1; i--)
```
```
    {
```
```
        max_heapify(a, i, n);
```
```
    }
```
```
}
```
```
int main()
```
```
{
```
```
    int n, i, x;
```

    cout<<"enter no of elements of array\n";

```
    cin>>n;
```
```
    int a[20];
```
```
    for (i = 1; i <= n; i++)
```
```
    {
```

        cout<<"enter element"<<(i)<<endl;

```
        cin>>a[i];
```
```
    }
```
```
    build_maxheap(a,n);
```
```
    heapsort(a, n);
```
```
    cout<<"sorted output\n";
```
```
    for (i = 1; i <= n; i++)
```
```
    {
```
```
        cout<<a[i]<<endl;
```
```
    }
```
```
    getch(); 
```
```
}
```
```
/* OUTPUT*/
```

Output
enter no of elements of array
7
enter element1
24
enter element2
35
enter element3
2
enter element4
49
enter element5
67
enter element6
34
enter element7
55
sorted output
2 24 34 35 49 55 67

Comments

How to create Bootable USB using Rufus

Rufus is a great software that allows you to create a bootable USB drive using an .ISO file.Its Ideal for installing programs and software on windows for whom CD drive are not available. In order to create a bootable USB drive you will need three things : 1 USB drive 2 Your .ISO file which you want to boot your USB with. 3. Rufus Let's get going!! STEP 1 First of all download Rufus , you can download it from their site - https://rufus.akeo.ie/ Download the latest version (right now its Rufus 2.9). You don't need to install it , it runs directly STEP 2 : Inser the USB drive and open Rufus , make sure you take backup of all files in your USB drive because Rufus will format the USB before booting it. STEP 3: Once you have started Rufus check for all desired things. Make sure device field is set to the correct device(device that you want to boot i.e USB) Also Make Sure "Create a bootable disk " option is ticked else i...

SQL Injection ,Hacking PHP 4.4 sites in seconds

Today I am going to teach you how to hack a certain type of websites with very least efforts. Websites with PHP 4.4 have a SQL injection vulnerability in them which makes their Admin control panel easily accessible,and in just few steps you will access the admin's account of that website. Remember,this tutorial is applicable on PHP 4.4 machines with Apache running in parallel with them. Also,since I will be hacking REAL websites,I will not be displaying their URL’s or else I will be sued!!!. Also this tutorial is only for educational purpose. Here we go!!! Step 1 – Search for them Yep,make a Google dork to find sites running Apache and PHP 4.4 . Its quite easy.You can do this by searching inurl:adminlogin . Step 2 – Scan them Start by scanning them using Nmap ,Do and intense scan and find the open ports. If you find port 2000 open,then you have almost got it. most websites running PHP4.4 have this port for admin login. Now just login using port 2000 ie - ...

Bellmanford Algorithm C++ Program

The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph . It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. Here is the Source Code: #include<iostream> #include<stdio.h> using namespace std; #include<conio.h> #define INFINITY 999 struct node { int cost; int value; int from; }a[5]; void addEdge(int am[][5],int src,int dest,int cost) { am[src][dest] = cost; return; } void bell(int am[][5]) { int i, j, k, c = 0, temp; a[0].cost = 0; a[0].from = 0; a[0].value = 0; for (i = 1; i < 5; i++) { ...

TECHSORTA

Search This Blog