Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- void display(int *T, int n);
- void combsort(int *T, int n);
- void bubblesort(int *T, int n);
- void countingsort(int *T,int *T2,int *T3, int n);
- void radixsort(int *T, int n);
- int main()
- {
- int P[9] = {6,3,9,2,4,7,1,8,5};
- int P2[10] = {0,0,0,0,0,0,0,0,0,0};
- int P3[9] = {0,0,0,0,0,0,0,0,0};
- int R[7] = {7125,21171,120,43589,73641,31975,51455,60433};
- display(P,9);
- countingsort(P,P2,P3,9);
- display(P3,9);
- system("PAUSE");
- return 0;
- }
- void display(int *T, int n)
- {
- cout<< " Tablica: ";
- for (int i=0; i<n; i++)
- {
- cout <<" " << T[i] ;
- }
- cout<<endl;
- }
- void combsort(int *T, int n)
- {
- int gap;
- int x;
- int i=0;
- gap = n * 10 / 13;
- while( gap >= 1)
- {
- while (i+gap < n)
- {
- if ( T[i] > T[i+gap] )
- {
- x = T[i];
- T[i] = T[i+gap];
- T[i+gap]=x;
- }
- i++;
- }
- gap = gap * 10 / 13 ;
- }
- }
- void bubblesort(int *T, int n)
- {
- }
- void countingsort(int *T,int *T2,int *T3, int n)
- {
- for(int i=0; i<n; i++)
- {
- T2[T[i]]++ ;
- }
- for(int i=1; i<=n; i++)
- {
- T2[i] = T2[i] + T2[i-1];
- }
- for(int i=0; i<n ; i++)
- {
- T3[T2[T[i]]-1]=T[i];
- T2[T[i]]-- ;
- }
- }
- void radixsort(int *T, int n)
- {
- int I,x,j,m;
- int d=10;
- for(int i=0; i<9; i++)
- {
- I[i][m]= 0; // m zle musi byz dynamicznie
- }
- // for() ?
- while(x != 0)
- {
- for(int i=0; i < n ; i++)
- {
- x= T[i] % d;
- for(int k=0 ; k<9 ; k++)
- {
- if (x==k)
- {
- I[k][j]= x;
- j++;
- }
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement