Which Of The Following Function Represents Pigeonhole Sort #894

 void Sorting(int arr[], int n) {  int minimum = arr[0], maximum = arr[0]; for (int i = 1; i < n; i++) { if (arr[i] < minimum) minimum = arr[i]; if (arr[i] > maximum) maximum = arr[i]; } int r = maximum - minimum + 1; vector<int> p_holes[n]; for (int i = 0; i < n; i++) p_holes[arr[i]-minimum].push_back(arr[i]); int ind = 0; for (int i = 0; i < r; i++) { vector<int>::iterator it; for (it = p_holes[i].begin(); it != p_holes[i].end(); ++it) arr[ind++] = *it; } } 

 void Sorting(int arr[], int n) {  int minimum = arr[0], maximum = arr[0]; for (int i = 1; i < n; i++) { if (arr[i] < minimum) minimum = arr[i]; if (arr[i] > maximum) maximum = arr[i]; } int r = maximum - minimum + 1; vector<int> p_holes[r]; for (int i = 0; i < n; i++) p_holes[arr[i]-minimum].push_back(arr[i]); int ind = 0; for (int i = 0; i < n; i++) { vector<int>::iterator it; for (it = p_holes[i].begin(); it != p_holes[i].end(); ++it) arr[ind++] = *it; } } 

 void Sorting(int arr[], int n) {  int minimum = arr[0], maximum = arr[0]; for (int i = 1; i < n; i++) { if (arr[i] < minimum) minimum = arr[i]; if (arr[i] > maximum) maximum = arr[i]; } int r = maximum - minimum + 1; vector<int> p_holes[n]; for (int i = 0; i < n; i++) p_holes[arr[i]-minimum].push_back(arr[i]); int ind = 0; for (int i = 0; i < n; i++) { vector<int>::iterator it; for (it = p_holes[i].begin(); it != p_holes[i].end(); ++it) arr[ind++] = *it; } }