Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- void swap(int *a, int *b)
- {
- int aux = *a;
- *a = *b;
- *b= aux;
- }
- void bubbleSort(int v[], int n) // parcurge vectorul si de fiecare data interschimba elementele vecine
- {
- int i,j;
- for (i = 1; i < n; i++)
- for (j = n; j >= i; j--)
- if (v[j] < v[j-1])
- swap(&v[j] , &v[j-1]);
- }
- void insertionSort(int v[], int n)
- {
- int i,j;
- for (i = 2; i <= n; i++)
- {
- j = i;
- while (j > 1 && v[j] < v[j-1])
- {
- swap(&v[j] , &v[j-1]);
- j--;
- }
- }
- }
- void selectionSort(int v[], int n) // gaseste minimul de fiecare data si il pune la inceptul listei
- {
- int i,j;
- for (i = 1; i<=n; i++)
- {
- int min = i;
- for (j = i + 1; j <= n; j++)
- if (v[min] > v[j])
- min=j;
- swap(&v[i] , &v[min]);
- }
- }
- int binarySearch(int v[], int s, int d, int x) // vector sortat crescator
- {
- if (d >= 1)
- {
- int mij = s + (d - 1)/2;
- if (v[mij] == x)
- return mij;
- if (v[mij] > x)
- return binarySearch(v, s, mij-1, x);
- return binarySearch(v,mij+1, d, x);
- }
- return -1; // inseamna ca nu s-a gasit elementul
- }
- int main()
- {
- int v[100],n,i;
- cout<<"Dimensiunea vectorului...\n";
- cin>>n;
- cout<<"Elementele vectorului...\n\n";
- for (i=1; i<=n; i++)
- cin>>v[i];
- //loc de testat algoritmi
- cout<<"\nVectorul sortat este... \n";
- for (i=1; i<=n; i++)
- cout<<v[i]<<" ";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement