Advertisement
Guest User

Untitled

a guest
Feb 27th, 2017
77
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.35 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3. ///void CautareBinara(int v[],int n)
  4.  
  5. void CautareSelectiva(int v[],int n)
  6. {int i,nr;
  7. cin>>nr;
  8. for(i=0;i<n;i++)
  9. if(v[i]==nr)
  10. {cout<<"Este";
  11. break;
  12. }
  13. if(i==n-1)
  14. cout<<"Nu este";
  15. }
  16. void SelectionSort(int v[],int n)
  17. {int i,j,mini,aux;
  18. for(i=0;i<n-1;i++)
  19. {mini=i;
  20. for(j=i+1;j<n;j++)
  21. if(v[j]<v[mini])
  22. mini=j;
  23. if(mini!=i)
  24. {aux=v[i];
  25. v[i]=v[mini];
  26. v[mini]=aux;
  27. }
  28. }
  29. for(i=0;i<n;i++)
  30. cout<<v[i]<<" ";
  31. }
  32. void InsertionSort(int v[],int n)
  33. {int i,j,aux;
  34. for(i=1;i<n;i++)
  35. {j=i;
  36. while(j>0&&v[j-1]>v[j])
  37. {aux=v[j];
  38. v[j]=v[j-1];
  39. v[j-1]=aux;
  40. j--;
  41. }
  42. }
  43. for(i=0;i<n;i++)
  44. cout<<v[i]<<" ";
  45. }
  46. void Interschimbare(int v[], int n) {
  47. int t=1,j=0,i;
  48. int aux;
  49. while(t)
  50. {t=0;
  51. j++;
  52. for(i=0;i<n-j;i++)
  53. {if(v[i]>v[i+1])
  54. {aux=v[i];
  55. v[i]=v[i+1];
  56. v[i+1]=aux;
  57. t=1;
  58. }
  59. }
  60. }
  61. for(i=0;i<n;i++)
  62. cout<<v[i]<<" ";
  63. }
  64. int main()
  65. {
  66. int i,n,x,v[100];
  67. cin>>n;
  68. for(i=0;i<n;i++)
  69. cin>>v[i];
  70. cout<<"Optiune:";
  71. cin>>x;
  72. switch(x)
  73. {case 1:Interschimbare(v,n);break;
  74. case 2:InsertionSort(v,n);break;
  75. case 3:SelectionSort(v,n);break;
  76. case 4:CautareSelectiva(v,n);break;
  77. ///case 5:CautareBinara(v,n);break;
  78. }
  79.  
  80. return 0;
  81. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement