adityanjr / code-ds-algo Goto Github PK

Instructions in README of this repo.

Hi @adityanjr,

I was just going through DS-Algo Notes folder, and I must say, It is a very good effort. But I think some concepts need more explanation and enhancement. I also believe that explaining the actual code through pseudocode might be very efficient.

Please let me know what do you think about that. If your thoughts align with mine, I would like to work on it.

choose the right folder to add your codes..

Project Euler (https://projecteuler.net/) consists of maths related problems.

#include
#include <math.h>
using namespace std;
int heapSize;

void buildMaxHeap(int[],int);

void maxHeapify(int ptr[], int i, int s)
{
int l = 2i + 1;
int r = 2i + 2;
int largest = i;
if((ptr[l]>ptr[largest]) && l<s)
largest = l;

if((ptr[r]>ptr[largest]) && r<s)
    largest = r;

if(largest != i)
{
    swap(ptr[i], ptr[largest]);
    maxHeapify(ptr, largest, s);
}

}

void buildMaxHeap(int ptr[], int s)
{
for(int i=(s/2)-1; i>=0; i--)
maxHeapify(ptr, i, s);

for (int i=s-1; i>=0; i--)
{
	swap(ptr[0], ptr[i]);
	maxHeapify(ptr, 0, i);
}

}

void heapSort(int ptr[], int s)
{
buildMaxHeap(ptr, s);
}

int main()
{
int * ptr, n;
cout << "Enter the size of the Array: ";
cin >> n;
ptr = new int[n];
if(ptr == NULL)
{
cout << "Insufficient Memory.";
}
cout<< "Enter the elements:\n";
for(int i=0; i<n; i++)
{
cout<<"["<<i<<"]:";
cin >> ptr[i];
}
heapSort(ptr, n);
cout << "\nSorted Array: \n";
for(int i=0; i<n; i++)
{
cout << ptr[i] << " ";
}
return 0;
}

#include
#include <math.h>
using namespace std;
int heapSize;

void buildMaxHeap(int[],int);

void maxHeapify(int ptr[], int i, int s)
{
int l = 2i + 1;
int r = 2i + 2;
int largest = i;
if((ptr[l]>ptr[largest]) && l<s)
largest = l;

if((ptr[r]>ptr[largest]) && r<s)
    largest = r;

if(largest != i)
{
    swap(ptr[i], ptr[largest]);
    maxHeapify(ptr, largest, s);
}

}

void buildMaxHeap(int ptr[], int s)
{
for(int i=(s/2)-1; i>=0; i--)
maxHeapify(ptr, i, s);

for (int i=s-1; i>=0; i--)
{
	swap(ptr[0], ptr[i]);
	maxHeapify(ptr, 0, i);
}

}

void heapSort(int ptr[], int s)
{
buildMaxHeap(ptr, s);
}

int main()
{
int * ptr, n;
cout << "Enter the size of the Array: ";
cin >> n;
ptr = new int[n];
if(ptr == NULL)
{
cout << "Insufficient Memory.";
}
cout<< "Enter the elements:\n";
for(int i=0; i<n; i++)
{
cout<<"["<<i<<"]:";
cin >> ptr[i];
}
heapSort(ptr, n);
cout << "\nSorted Array: \n";
for(int i=0; i<n; i++)
{
cout << ptr[i] << " ";
}
return 0;
}