Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream f("DATE.IN");
- int V[10000], n, i, j;
- void citire()
- {
- f>>n;
- while(!f.eof())
- for(i=1; i<=n; i++)
- f>>V[i];
- }
- int poz(int p, int u)
- {
- int k, piv, aux;
- piv=V[p];
- while(p<u){
- if(V[p] > V[u]){
- aux=V[p];
- V[p]=V[u];
- V[u]=aux;
- }
- if(V[p]==piv)
- u--;
- else p++;
- }
- k=p;
- return k;
- }
- void qsort(int p, int u)
- {
- int k;
- if(p<u){
- k=poz(p,u); //k=4
- qsort(p, k-1); //qsort(1, 3);
- qsort(k+1, u); //qsort(5, 6);
- }
- }
- void afisare()
- {
- for(i=1; i<=n; i++)
- cout<<V[i]<<" ";
- }
- void bubblesort(int V[100], int n)
- {
- int gasit, aux;
- do{
- gasit=1;
- for(i=1; i<n; i++)
- if(V[i]>V[i+1]){
- aux=V[i];
- V[i]=V[i+1];
- V[i+1]=aux;
- gasit=0;
- }
- }while(gasit==0);
- }
- void selectie(int V[100], int n)
- {
- int aux;
- for(i=1; i<=n-1; i++)
- for(j=i+1; j<=n; j++){
- if(V[i] > V[j]){
- aux=V[j];
- V[j]=V[i];
- V[i]=aux;
- }
- }
- }
- int main()
- {
- citire();
- selectie(V, n);
- afisare();
- f.close();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement