Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cstdlib>
- #include <iostream>
- void countingSort(int Arreglo[]){
- int Menor = Arreglo[0];
- int Mayor = Arreglo[0];
- int largo = sizeof(Arreglo);
- int i = 0;
- while (i <largo){
- if (Arreglo[i]< Menor){
- Menor = Arreglo[i];
- }
- else if (Arreglo[i]>Mayor){
- Mayor = Arreglo[i];
- }
- i++;
- }
- i = Mayor - Menor;
- int tem[i];
- i = 0;
- while (i < largo){
- tem[Menor - Arreglo[i]]= tem[Menor - Arreglo[i]]++;
- i++;
- }
- i = 0;
- int T = 0;
- largo = sizeof(tem);
- while (i < largo){
- int j = tem[i];
- while (j !=0 ){
- Arreglo[T] = tem[i];
- j--;
- }
- i++;
- }
- }
- int main()
- {
- int x;
- int i = 0;
- std::cout << "Ingrese el tamaño del arreglo ";
- std::cin >> x;
- int Arreglo[x];
- while (i != x){
- int y;
- std::cout << "Ingrese el dato ";
- std::cin >> y;
- Arreglo [i]=y;
- i++;
- }
- std::cout << "Datos incertados ";
- countingSort(Arreglo);
- i = 0;
- while (i != x){
- int y;
- std::cout << Arreglo [i];
- i++;
- }
- system("PAUSE");
- return EXIT_SUCCESS;
- }
Add Comment
Please, Sign In to add comment