Scribd
Upload
6 views2 pages

Vector Sorting and Searching Algorithms

The document describes several algorithms for common vector operations: - Sorting a vector using bubble sort by repeatedly swapping adjacent elements out of order until the vector is fully sorted. - Performing a binary search on a sorted vector to find a target value by repeatedly checking the middle element and narrowing the search range. - Rotating all elements of a vector left or right by one position by shifting each element and placing the first element in the last position. - Removing even elements from a vector by shifting all subsequent elements left to fill the gaps.

Uploaded by

Razvan George Costan
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views2 pages

Vector Sorting and Searching Algorithms

The document describes several algorithms for common vector operations: - Sorting a vector using bubble sort by repeatedly swapping adjacent elements out of order until the vector is fully sorted. - Performing a binary search on a sorted vector to find a target value by repeatedly checking the middle element and narrowing the search range. - Rotating all elements of a vector left or right by one position by shifting each element and placing the first element in the last position. - Removing even elements from a vector by shifting all subsequent elements left to fill the gaps.

Uploaded by

Razvan George Costan
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Algoritmi

Ordonarea vectorilor: Stergerea dintr-un vector:


for(i=1;i<n;i++) …….
for(j=i+1;j<=n;j++) i=1;
if(v[i]>v[j]) while(i<=n)
{aux=v[i];v[i]=v[j];v[j]=aux;} if(v[i]%2==0)
for(j=i+1;j<=n;j++)
Cautarea binara: v[j-1]=v[j];
p=1;u=n;poz=-1; n--;}
while(p<=u&&poz==-1) else i++;
{m(p+u)/2;
If(k==v[m]) poz=m; Rotirea circ spre stanga: Spre dreapta:
else if (k<v[m]) u=m-1; aux=v[i]; aux=v[n];
else p=m+1; for(i=2;i<=n;i++) for(i=n;i<=2;i--)
if(poz!=-1) cout <<”Da pe poz.”<<poz; v[i-1]=v[i]; v[i]=v[i-1];
else cout<<”Nu”; v[n]=aux; v[i]=aux;

Metoda bulelor: Inserare intr-un vector:


ok=0(pres ca vect este ordonat) for(i=n;i>=2;i--)
do {v[2*i-1]=v[i];
{ok=1; v[2*i-2]=(v[i]+v[i-1])/2;
for(i=1;i<=n-nr;i++) }
if(v[i]>v[i+1])
{aux=v[i];v[i]=v[i+1];v[i+1]=aux; Inserare dupa un element oarecare:
ok=0; i=1;
} while(i<=n)
nr++ if cond {for(j=n;j>=i+1;j--)
while(ok==0)……………. v[j+1]=v[j];n++;
v[i+1]=val. noua;
Formare de vectori noi: i=i+2;}
cin>>n;m=0; else
for(i=1;i<=n;i++) i++;}
cin>>x;
if(x%2==0)(sau alta conditie) Vector caracteristic/frecvente:
{m++;v[m]=x;} while(x!=0)
} {cifra=x%10;
for(i=1;i<=m;i++) c[cifra]++;
cout<<v[i]<<’ ‘; x/=10;}
for(cifra=0;cifra<=9;cifra++)
cout<<cifra<<’ ‘<<c[cifra]<<endl;
Algoritmi

You might also like