Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cstdlib>
- #include <iostream>
- using namespace std;
- const int mprec[] =
- {
- 0, // 0 zero
- 5, // 1 one
- 1, // 2 two
- 2, // 3 three
- 7, // 4 four
- 8, // 5 five
- 3, // 6 six
- 4, // 7 seven
- 9, // 8 eight
- 6, // 9 nine
- };
- int mdig(int n)
- {
- while(n > 9)
- n/=10;
- return n;
- }
- int ssort(int *arr, int size)
- {
- for (int i = 0; i < size; i++)
- {
- int x = i;
- for (int j = i+1; j < size; j++)
- if (mprec[mdig(arr[x])] < mprec[mdig(arr[j])])
- x = j;
- if (x != i)
- {
- arr[i] ^= arr[x];
- arr[x] ^= arr[i];
- arr[i] ^= arr[x];
- }
- }
- }
- int main(void)
- {
- int arr[] = {23, 1, 5, 6};
- ssort(arr, sizeof(arr)/sizeof(arr[0]));
- for (int i = 0; i < 4; i++)
- cout << arr[i] << ' ';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement