Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <time.h>
- using namespace std;
- void zamien(int & a, int &b){
- int temp;
- temp=a;
- a=b;
- b=temp;
- }
- int findmin(int tab[], int n, int start){
- int mini=start;
- for(int i=start; i<n; i++){
- if(tab[mini]>tab[i])mini=i;
- }
- return mini;
- }
- void chsort(int tab[],int n){
- int mini, i=0;
- while(i!=n){
- mini=findmin(tab, n, i);
- zamien(tab[i],tab[mini]);
- i++;
- }
- }
- int findmax(int tab[], int n){
- int maxi=tab[0];
- for(int i=0; i<n; i++){
- if(maxi<tab[i])maxi=tab[i];
- }
- return maxi;
- }
- void sortow(int tab[], int n, int maxi){
- int liczba;
- int tabl[20000];
- for( int i = 0; i < maxi; i++ ){
- tabl[i]=0;
- }
- for(int i=0; i<n; i++){
- liczba=tab[i];
- tabl[liczba]=tabl[liczba]+1;
- }
- int j=0;
- for(int i=0; i<maxi+1; i++){
- while(tabl[i]!=0){
- tab[j]=i;
- tabl[i]=tabl[i]-1;
- j++;
- }
- }
- }
- int main()
- { /* int tab[20000], n;
- cout<<"Podaj rozmiar tablicy: "; cin>>n;
- cout<<"Podaj elemrnty tablicy: ";
- for( int i = 0; i < n; i++ ){
- cin>>tab[i];
- }
- cout<<"Tablica startowa to: ";
- for( int i = 0; i < n; i++ ){
- cout<<tab[i]<<", ";
- }
- cout<<endl;
- chsort(tab, n);
- cout<<"Tablica posortowana to: ";
- for( int i = 0; i < n; i++ ){
- cout<<tab[i]<<", ";
- }
- */
- int tab[20000], n, maxi;
- cout<<"Podaj rozmiar tablicy: "; cin>>n;
- cout<<"Podaj elemrnty tablicy: ";
- for( int i = 0; i < n; i++ ){
- cin>>tab[i];
- }
- cout<<"Tablica startowa to: ";
- for( int i = 0; i < n; i++ ){
- cout<<tab[i]<<", ";
- }
- cout<<endl;
- maxi=findmax(tab, n);
- sortow(tab, n, maxi);
- cout<<"Tablica posortowana to: ";
- for( int i = 0; i < n; i++ ){
- cout<<tab[i]<<", ";
- }
- cout<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement