profu.info

Am realizat un microblog educational la adresa

http://www.edmodo.com/public/profudeinfo/c

de unde puteti downloada gratuit resurse esentiale despre limbajul C++.

Iata o mica parte din resurse:

Clasa a XI -a

1. Sortarea crescatoarea a unui tablou unidimensional in C++

#include<iostream.h>

typedef int sir[25];
sir v;

int i, n, ok, aux;

void main()
{
cout<<”n=”;
cin>>n;

for(i=1;i<=n;i++)
{
cout<<”v["<<i<<"]=”;
cin>>v[i];
}

for(i=1;i<=n;i++)
cout<<v[i]<<” “;

//sortarea crescatoare

do{

ok=1;

for(i=1;i<=n-1;i++)
if(v[i]>v[i+1])
{

// interschimbare
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;

ok=0;
}

}while(ok!=1);

cout<<”——————–”<<endl;
for(i=1;i<=n;i++)
cout<<v[i]<<” “;

}

2. Cautarea binara intr-un tablou unidimensional -  C++

#include<iostream.h>
#include<math.h>

typedef int sir[25];
sir v;
int i,n,li,ls,lm, gasit;

void main()
{
cout<<”n=”;
cin>>n;

cout<<”Cauta elementul =”;
cin>>x;

for(i=1;i<=n;i++)
{
cout<<”v["<<i<<"]=”;
cin>>v[i];
}

for(i=1;i<=n;i++)
cout<<v[i]<<” “;

li=1;
ls=n;
gasit=0;

while((li<=ls)&&(!gasit))
{

lm=floor((li+ls)/2);
if(v[lm]<x)
{
li=lm+1;
}
else if(v[lm]==x)
{
cout<<”l-am gasit pe pozitia”<<lm;
gasit=1;
}
else ls=lm-1;
}

}

3. Interclasarea a doua tablouri unidimensionala in C++

#include<iostream.h>
typedef int sir[25];
sir a,b,c;
int n,m,i,j,k;

void main(void)
{
cout<<”Introduceti lungimile celor 2 vectori a si b= “;
cin>>m>>n;

// cititi elementele celor 2 vectori ordonati crescatori
for(i=1;i<=m;i++)
{
cout<<”a["<<i<<"]=”;
cin>>a[i];
}

for(i=1;i<=n;i++)
{
cout<<”b["<<i<<"]=”;
cin>>b[i];
}

// interclasarea

i=1;
j=1;
k=0;

while((i<=m)&&(j<=n))
{

if(a[i]<b[j])
{
k++;
c[k]=a[i];
i++;
}

else {
k++;
c[k]=b[j];
j++;
}

}

// adaugam elementele ramase neparcurse

if(i<=m)
{
while(i<=m)
{
k++;
c[k]=a[i];
i++;
}

}

if(j<=n)
{
while(j<=n)
{
k++;
c[k]=b[j];
j++;
}
}

// afisez vectorul interclasat
for(i=1;i<=k;i++)
cout<<c[i]<<”  “<<endl;

}