Question

Nedret Taciroğlu is a worldwide known fashion designer. She has a collection of n dresses of different size and corresponding n fashion model. She can choose any dress & any fashion model together, from which she can determine whether the dress is large for fashion model, small for model or matches the model exactly. However there is no way to compare two dresses together or two fashion model together. She needs an efficient method to match each dress to its matching fashion model. Try to find an algorithm that will solve this problem by getting help from the Quick Sort algorithm.

Answer 1

 /* C++ implementation of QuickSort */ #include <bits/stdc++.h> using namespace std; // A utility function to swap two elements void swap(int* a, int* b) {       int t = *a;     *a = *b;        *b = t; } /* This function takes last element as pivot, places the pivot element at its correct position in sorted array, and places all smaller (smaller than pivot) to left of pivot and all greater elements to right of pivot */ int partition (int arr[], int low, int high) {     int pivot = arr[high]; // pivot         int i = (low - 1); // Index of smaller element  for (int j = low; j <= high - 1; j++)        {               // If current element is smaller than the pivot                 if (arr[j] < pivot)          {                       i++; // increment index of smaller element                      swap(&arr[i], &arr[j]);                 }       }       swap(&arr[i + 1], &arr[high]);  return (i + 1); } /* The main function that implements QuickSort arr[] --> Array to be sorted, low --> Starting index, high --> Ending index */ void quickSort(int arr[], int low, int high) {         if (low < high)      {               /* pi is partitioning index, arr[p] is now              at right place */               int pi = partition(arr, low, high);             // Separately sort elements before              // partition and after partition                quickSort(arr, low, pi - 1);            quickSort(arr, pi + 1, high);   } } /* Function to print an array */ void printArray(int arr[], int size) {     int i;  for (i = 0; i < size; i++)           cout << arr[i] << " ";      cout << endl; } // Driver Code int main() { int m=0; cin>>m;        int arr[m]; int arr1[m];        cout<<"Enter Dress Sizes";        for(int i=0;i<m;i++)         cin>>arr[i];      cout<<"Enter Model Sizes";        for(int i=0;i<m;i++)         cin>>arr1[i];     int n = sizeof(arr) / sizeof(arr[0]);   quickSort(arr, 0, n - 1);       cout << "Sorted dresses: \n";     printArray(arr, n);     int n2= sizeof(arr1)/sizeof(arr[0]);    quickSort(arr1,0,n-1);  printArray(arr1,n);     return 0; } // This code is contributed by rathbhupendra 

Input

Enter Dress Sizes24 22 Enter Model Sizes45 65

Output

Sorted dresses: 22 24 45 65 ... Program finished with exit code o

Hope your Doubts were cleared, Please respond back if not so I can help you out!

Thankyou!