Advertisement
Guest User

Untitled

a guest
Dec 14th, 2018
64
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.58 KB | None | 0 0
  1. #include <iostream>
  2. #include <cstdlib>
  3. #include <ctime>
  4. /* run this program using the console pauser or add your own getch, system("pause") or input loop */
  5. using namespace std;
  6. void babelkowe1(int n,int tab[]);
  7. void babelkowe2(int n,int tab[]);
  8. void babelkowe3(int n,int tab[]);
  9. void przesowisko(int n,int tab[]);
  10. int main(int argc, char** argv) {
  11. int tab[20];
  12. srand(time(NULL));
  13. for(int j=0;j<20;j++)
  14. {tab[j]=rand()%100;
  15. cout<<tab[j]<<" ,";
  16. }
  17. babelkowe1(20,tab);
  18. cout<<"po sortowaniu"<<endl;
  19. for(int j=0;j<20;j++)
  20. cout<<tab[j]<<", ";
  21. babelkowe2(20,tab);
  22. cout<<"po sortexie"<<endl;
  23. for(int j=0;j<20;j++)
  24. cout<<tab[j]<<", ";
  25. babelkowe3(20,tab);
  26. cout<<"po sortexie"<<endl;
  27. for(int j=0;j<20;j++)
  28. cout<<tab[j]<<", ";
  29. przesowisko(20,tab);
  30. cout<<"po sortowaniu2"<<endl;
  31. for(int j=0;j<20;j++)
  32. cout<<tab[j]<<", ";
  33.  
  34.  
  35. return 0;
  36. }
  37. void babelkowe1(int n,int tab[])
  38. {
  39. for(int k=0;k<n-1;k++)
  40. for(int j=0;j<n-1-k;j++)
  41. {
  42. if(tab[j+1]<tab[j])
  43. swap(tab[j+1], tab[j]);
  44. }
  45. }
  46. void babelkowe2(int n,int tab[])
  47. {
  48. for(int k=0;k<n-1;k++)
  49. for(int j=0;j<n-1;j++)
  50. {
  51. if(tab[j+1]<tab[j])
  52. swap(tab[j+1], tab[j]);
  53. }
  54. }
  55. void babelkowe3(int n,int tab[])
  56. {
  57. int zamiana;
  58. for(int k=0;k<n-1;k++)
  59. {zamiana=0;
  60. for(int j=0;j<n-1-k;j++)
  61. {
  62. if(tab[j+1]<tab[j])
  63. swap(tab[j+1], tab[j]);
  64. zamiana++;
  65. }
  66. }
  67. if(zamiana==0) return;
  68. }
  69. void przesowisko(int n,int tab[])
  70. {
  71. int pom;
  72. int j;
  73. for(int k=1;k<n;k++)
  74. {
  75. pom=tab[k];
  76. j=k-1;
  77. while(j>=0&&tab[j]>pom)
  78. {
  79. tab[j+1]=tab[j];
  80. j--;
  81. }
  82. tab[j+1]=pom;
  83. }
  84. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement