Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int mini = 0;
- int maxi = 0;
- float *koniec;
- void sortowanie(float T[], int n)
- {
- mini = T[0];
- maxi = T[0];
- for(int i=0;i<n;i++)
- {
- T[i]*=100;
- }
- for(int i=0;i<n;i++)
- {
- if(T[i]>maxi)maxi=T[i];
- else if(T[i]<mini) mini = T[i];
- }
- int ile = (maxi-mini)+1;
- int *zliczanie = new int [ile];
- int *suma = new int [ile];
- koniec = new float [n];
- for(int i=0;i<ile;i++)
- {
- zliczanie[i]=0;
- }
- for(int i=0;i<n;i++)
- {
- zliczanie[(int)T[i]-mini]++;
- }
- suma[0] = zliczanie[0];
- for(int i=0;i<ile;i++)
- {
- suma[i+1] = suma[i]+zliczanie[i+1];
- }
- for(int i=0;i<n;i++)
- {
- suma[(int)T[i]-mini]--;
- koniec[suma[(int)T[i]-mini]]=T[i];
- }
- for(int i=0;i<n;i++)
- {
- koniec[i]/=100;
- }
- for(int i=0;i<n;i++)
- {
- cout<<koniec[i]<<", ";
- }
- }
- int main()
- {
- int n;
- cout << "Ile liczb: ";cin>>n;
- float T[n];
- //int *T = new int [n];
- for(int i = 0;i<n;i++)
- {
- cin>>T[i];
- }
- sortowanie(T,n);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement