Documente Academic
Documente Profesional
Documente Cultură
HONDURAS
Asignatura: Programación I.
Tema: Tarea Arreglos Unidimensionales (Guía II parcial).
Profesora: María Del Carmen Velásquez.
#include <math.h>
int main()
float A[100];
int i, t, j, n;
cin>>n;
cout<<"\n";
suma(A,n);
return 0;
{
int i, t, j;
A[0]=1.5;
A[1]=1;
t=i-1;
A[i]=A[t]-0.5;
A[n]=pow(A[n-1],2)-2*(A[n-2]);
cout<<"A["<<j<<"]="<<A[j]<<endl;
}
INCISO (e)
#include <iostream>
#include <ctime>
int main()
int n=0;
int A[100], i, t;
cin>>n;
cout<<" "<<endl;
srand(time(0));
t=0;
A[i]=t;
cout<<"A["<<i<<"]="<<A[i]<<endl;
ordenar(A,n);
return 0;
int c, d, aux;
if(A[d]>A[d+1])
aux=A[d];
A[d]=A[d+1];
A[d+1]=aux;
cout<<" "<<endl;
cout<<A[c]<<", ";
cout<<"fin.";
cout<<" "<<endl;
cout<<A[c]<<", ";
cout<<"fin.";
}
INCISO (o)
#include <iostream>
#include <ctime>
int main()
cin>>N;
cout<<" "<<endl;
srand(time(0));
t=0;
t=rand()%N;
X[i]=t;
cout<<"X["<<i<<"]="<<X[i]<<endl;
cout<<" "<<endl;
cin>>n;
bus_pos(X,N,n);
return 0;
int i=1, s, j, c;
while((n!=X[i])&&(i<N))
s=0;
i+=1;
}
if (n==X[i])
s=1;
cout<<" "<<endl;
if (s==1)
if (n==X[j])
cout<<"posición: "<<"X["<<j<<"]="<<X[j]<<endl;
c++;
else
if (s==0)
}
INCISO (p)
#include <iostream>
int main()
while(n<=0)
cin>>n;
cout<<"\n \n";
cout<<"Introducir X["<<i<<"]=";
cin>>j;
X[i]=j;
while (j<=0)
cout<<"\n";
cout<<"Introducir X["<<i<<"]=";
cin>>j;
X[i]=j;
cout<<"\n";
par_impar(X,n);
return 0;
p=X[d];
if(p%2==0)
xpar[y]=p;
cont1++;
y+=1;
else
ximpar[z]=p;
cont2++;
z+=1;
y-=1;
z-=1;
cout<<"Numeros pares: ";
cout<<xpar[f]<<", ";
cout<<"Fin."<<endl;;
cout<<"\n";
cout<<ximpar[g]<<", ";
cout<<"Fin."<<endl;