Merge pull request navneet-bhole95#16 from mahesh1102/main

first pull request

calculator.cpp

@@ -0,0 +1,49 @@
+// Basic calculator that adds, subtracts, multiplies, and divides
+#include <iostream>
+using std::cin; using std::cout; using std::endl;
+
+int main() {
+    char yor = 'y';
+    char op;
+    float num1, num2;
+
+	while(yor=='y'){
+		cin>>num1>>op>>num2;
+    switch(op)
+    {
+
+        case '+': // Adds num1 by num2
+            cout << num1+num2<<"\n";
+            break;
+        case '-': // Subtracts num1 by num2
+            cout << num1-num2<<"\n";
+            break;
+        case '*': // Multiplies num1 by num2
+            cout << num1*num2<<"\n";
+            break;
+        case '/': // Divides num1 by num2
+			if (num2 != 0)
+				cout << num1/num2<<"\n";
+			else
+				cout << "You cannot divide by 0!";
+            break;
+        case '%': // Returns remainder of num1 divided by num2
+			if (num2 != 0)
+				cout << (int)num1%(int)num2<<"\n";
+			else
+				cout << "You cannot divide by 0!";
+            break;
+        default:
+            // If the operator is other than +, -, * or /, error message is shown
+            cout << "Error! Operator is not correct!" << endl;
+            break;
+    }
+    cout<<"do you want to use calculator y/n:";
+    cin>>yor;
+    cout<<"\n";
+	}	
+
+	return 0;
+
+
+}

heapsort.cpp

@@ -0,0 +1,69 @@
+// C++ program for implementation of Heap Sort 
+#include <bits\stdc++.h> 
+using namespace std; 
+
+// To heapify a subtree rooted with node i which is 
+// an index in arr[]. n is size of heap 
+void heapify(int arr[], int n, int i) 
+{ 
+	int largest = i; // Initialize largest as root 
+	int l = 2 * i + 1; // left = 2*i + 1 
+	int r = 2 * i + 2; // right = 2*i + 2 
+
+	// If left child is larger than root 
+	if (l < n && arr[l] > arr[largest]) 
+		largest = l; 
+
+	// If right child is larger than largest so far 
+	if (r < n && arr[r] > arr[largest]) 
+		largest = r; 
+
+	// If largest is not root 
+	if (largest != i) { 
+		swap(arr[i], arr[largest]); 
+
+		// Recursively heapify the affected sub-tree 
+		heapify(arr, n, largest); 
+	} 
+} 
+
+// main function to do heap sort 
+void heapSort(int arr[], int n) 
+{ 
+	// Build heap (rearrange array) 
+	for (int i = n / 2 - 1; i >= 0; i--) 
+		heapify(arr, n, i); 
+
+	// One by one extract an element from heap 
+	for (int i = n - 1; i >= 0; i--) { 
+		// Move current root to end 
+		swap(arr[0], arr[i]); 
+
+		// call max heapify on the reduced heap 
+		heapify(arr, i, 0); 
+	} 
+} 
+
+/* A utility function to print array of size n */
+void printArray(int arr[], int n) 
+{ 
+	for (int i = 0; i < n; ++i) 
+		cout << arr[i] << " "; 
+	cout << "\n"; 
+} 
+
+// Driver program 
+int main() 
+{ 
+	int n;
+	cin>>n;
+	int arr[n];
+	for(int i=0;i<n;i++)
+	cin>>arr[i]; 
+
+	heapSort(arr, n); 
+
+	cout << "Sorted array is \n"; 
+	printArray(arr, n); 
+} 
+