Question

write pigeonhole algorithrm?​

Answer 1

Explanation:

Pigeonhole sorting is a sorting algorithm that is suitable for sorting lists of elements where the number of elements (n) and the length of the range of possible key values (N) are approximately the same. It requires O(n + N) time.Worst complexity: n+2^k

Average complexity: n+2^k

Space complexity: 2^k

Stable: Yes

Answer 2

Answer:

ps

filter_none

edit

play_arrow

brightness_4

/* C program to implement Pigeonhole Sort */

#include <bits/stdc++.h>

using namespace std;

/* Sorts the array using pigeonhole algorithm */

void pigeonholeSort(int arr[], int n)

{

// Find minimum and maximum values in arr[]

int min = arr[0], max = arr[0];

for (int i = 1; i < n; i++)

{

if (arr[i] < min)

min = arr[i];

if (arr[i] > max)

max = arr[i];

}

int range = max - min + 1; // Find range

// Create an array of vectors. Size of array

// range. Each vector represents a hole that

// is going to contain matching elements.

vector<int> holes[range];

// Traverse through input array and put every

// element in its respective hole

for (int i = 0; i < n; i++)

holes[arr[i]-min].push_back(arr[i]);

// Traverse through all holes one by one. For

// every hole, take its elements and put in

// array.

int index = 0; // index in sorted array

for (int i = 0; i < range; i++)

{

vector<int>::iterator it;

for (it = holes[i].begin(); it != holes[i].end(); ++it)

arr[index++] = *it;

}

}

// Driver program to test the above function

int main()

{

int arr[] = {8, 3, 2, 7, 4, 6, 8};

int n = sizeof(arr)/sizeof(arr[0]);

pigeonholeSort(arr, n);

printf("Sorted order is : ");

for (int i = 0; i < n; i++)

printf("%d ", arr[i]);

return 0;

}