Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- ///void CautareBinara(int v[],int n)
- void CautareSelectiva(int v[],int n)
- {int i,nr;
- cin>>nr;
- for(i=0;i<n;i++)
- if(v[i]==nr)
- {cout<<"Este";
- break;
- }
- if(i==n-1)
- cout<<"Nu este";
- }
- void SelectionSort(int v[],int n)
- {int i,j,mini,aux;
- for(i=0;i<n-1;i++)
- {mini=i;
- for(j=i+1;j<n;j++)
- if(v[j]<v[mini])
- mini=j;
- if(mini!=i)
- {aux=v[i];
- v[i]=v[mini];
- v[mini]=aux;
- }
- }
- for(i=0;i<n;i++)
- cout<<v[i]<<" ";
- }
- void InsertionSort(int v[],int n)
- {int i,j,aux;
- for(i=1;i<n;i++)
- {j=i;
- while(j>0&&v[j-1]>v[j])
- {aux=v[j];
- v[j]=v[j-1];
- v[j-1]=aux;
- j--;
- }
- }
- for(i=0;i<n;i++)
- cout<<v[i]<<" ";
- }
- void Interschimbare(int v[], int n) {
- int t=1,j=0,i;
- int aux;
- while(t)
- {t=0;
- j++;
- for(i=0;i<n-j;i++)
- {if(v[i]>v[i+1])
- {aux=v[i];
- v[i]=v[i+1];
- v[i+1]=aux;
- t=1;
- }
- }
- }
- for(i=0;i<n;i++)
- cout<<v[i]<<" ";
- }
- int main()
- {
- int i,n,x,v[100];
- cin>>n;
- for(i=0;i<n;i++)
- cin>>v[i];
- cout<<"Optiune:";
- cin>>x;
- switch(x)
- {case 1:Interschimbare(v,n);break;
- case 2:InsertionSort(v,n);break;
- case 3:SelectionSort(v,n);break;
- case 4:CautareSelectiva(v,n);break;
- ///case 5:CautareBinara(v,n);break;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement