int main(void)
{
int arr[5], i;
for (i = 0; i < 5; i++) {
printf("Ingrese el elemento %d\n", i+1);
scanf("%d", &arr[i]);
}
printf("El elemento mayor es %d\n", buscar_mayor(arr));
printf("El elemento menor es %d\n", buscar_menor(arr));
printf("El promedio es %.2f\n", hallar_promedio(arr));
return 0;
}
void ORGNZDR::modificacion(int p_a_p, int s_a_s, int n_ord){
int mayor; int menor; int n= 0;
for (int i = 0; i < n_ord; i++) {
mayor = buscar_mayor(i, n);
int tp = vector.get_V(i);
vector.set_V(vector.get_V(mayor), i);
for (int x = i; x < mayor; x++) {
int tp1 = vector.get_V(x+1);
vector.set_V(tp, x+1);
tp = tp1;
}
}
int k = vector.get_sz()-1;
for (int i = 0; i < n_ord; i++) {
cout << k << endl;
menor = buscar_menor2(k, n);
cout << "MENOR: " << vector.get_V(menor) << endl;
int tp = vector.get_V(k);
vector.set_V(vector.get_V(menor), k);
for (int x = k; x > menor; x--) {
int h = x-1;
int tp1 = vector.get_V(h);
vector.set_V(tp, h);
tp = tp1;
}
k=k-1;
}
if (n < vector.get_min()) {
vector.set_min(n);
}
if (n > vector.get_max()) {
vector.set_max(n);
}
vector.set_max((float(vector.get_min())+vector.get_max())/2);
mostrar_final_modificacion(n_ord);
}
