Question: How do I fix these errors? #include #include #include #define text_width 12 // print formatting using namespace std; int userInput(); void print(int a[], int len,
How do I fix these errors? 
#include
#define text_width 12 // print formatting
using namespace std; int userInput(); void print(int a[], int len, int startFrom); void heapSort(int arr[], int n); void heapify(int arr[], int n, int i); void mergeSort(int arr[], int l, int r); void merge(int arr[], int l, int m, int r); void quickSort(int arr[], int low, int high); int partition(int arr[], int low, int high); void swap(int *a, int *b);
int main() { int len; cin >> len; int *array = new int[len]; srand(time(0)); for (int x = 0; x
for (int x = 0; x elapsed_time = end - start; // cout = 0; i--) heapify(arr, n, i); for (int i = n - 1; i > 0; i--) { swap(arr[0], arr[i]); heapify(arr, i, 0); } } void heapify(int arr[], int n, int i) { int largest = i; int l = 2 * i + 1; int r = 2 * i + 2; if (l arr[largest]) largest = l; if (r arr[largest]) largest = r; if (largest != i) { swap(arr[i], arr[largest]); heapify(arr, n, largest); } } void merge(int arr[], int l, int m, int r) { int n1 = m - l + 1; int n2 = r - m; int *L = new int[n1]; int *R = new int[n2]; for (int i = 0; i = r) { return; } int m = (l + r - 1) / 2; mergeSort(arr, l, m); mergeSort(arr, m + 1, r); merge(arr, l, m, r); }
void swap(int *a, int *b) { int t = *a; *a = *b; *b = t; }
int partition(int arr[], int low, int high) { int pivot = arr[high]; int i = (low - 1); for (int j = low; j
void quickSort(int arr[], int low, int high) { if (low main.cpp:179:3: warning: 'delete' applied to a pointer that was allocated with 'new[]'; did you mean 'delete[]'? [-Wmismatched-new-delete] delete L; [] main.cpp:143:12: note: allocated with 'new[]' here int L= new int [n1]; main.cpp:180:3: warning: 'delete' applied to a pointer that was allocated with 'new[]'; did you mean 'delete[]'? [-Wmismatched-new-delete] delete R; []] main.cpp:144:12: note: allocated with 'new[]' here int R= new int[n2]; 2 warnings generated
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
