Analisis de sistemas

//Ordenamiento Shell |
02 | //Codificado por sAfOrAs |
03 | #include<iostream> |
04 | #include"leearreglo.h" |
05 | using namespace std; |
06 |#define largo 50 |
07 | void ordenShell(int A[],int n) |
08 | { |
09 |       |
10 |   int i, j, inc, temp; |
11 |    |
12 |   for(inc = 1 ;inc<n;inc=inc*3+1); |
13 |     |
14 |       while (inc > 0) |
15 |       { |
16 |           for (i=inc; i < n; i++) |
17 |           { |18 |                 j = i; |
19 |                 temp = A[i]; |
20 |                 while ((j >= inc) && (A[j-inc] > temp)) |
21 |                { |
22 |                     A[j] = A[j - inc]; |
23 |                     j = j - inc; |
24 |                 } |
25 |         |
26 |                 A[j] = temp;|
27 |           } |
28 |           |
29 |           inc/= 2; |
30 |       } |
31 | } |
32 |    |
33 |    |
34 | voidmain () |
35 | { |
36 |     int A[largo],n; |
37 |     do{ |
38 |     cout<<"Cantidad de numeros a ingresar: ";cin>>n; |
39 |        if(n<=0||n>largo) |
40 |             cout<<"Debe ingresar un valor  > a 0 y < a "<<largo<<endl; |
41 |     }while(n<=0||n>largo); |
42 |   |43 |     leeCadena(n,A); |
44 |     ordenShell(A,n); |
45 |     muestraCadena(n,A); |
46 |     |
47 | } |

#include<iostream> |
02 |using namespace std; |
03 | void leeCadena(int cant,int n[]) |
04 | { |
05 |     int i; |
06 |     for(i=0;i<cant;i++) |
07...