.
: :
- ;
- , .
:
1. :
) ;
) ;
) () .
2. :
) ( );
) ( HeapSort), ;
) (QuickSort), ; ;
3. i- .
:
1. Delphi Structures.
2. 3, :
1) SortBase
2) SortBest
I ( 3÷6)
3. 1) SortBase Sortirovka1, .
4. Sortirovka1 , , , 3.1.
5. onClick Object Pascal . .
6. , , - , .
II ( 7÷10)
7. SortBest Sortirovka2, .
8. , , 3.2.
9. onClick . .
10. .6, , . .
3.1
| . | |
| 1. | const n=31; var x: array [1..n] of integer; p: integer; k: 1..n; found: boolean; . : , found TRUE, , found FALSE . |
| 2. | var x: array [1..20] of 1..21; y: 1..21; . , y [1..21], . |
| 3. | var x: array [1..20] of real; , ( ). , (), , . |
| 4. | const n=20; var x: array [1..n] of real; , ( : (i -1) 1) ( ) ( 1- (i -1)- ). |
| 5. | var x: array [1..20] of 1..21; y: 1..21; . , , y [1..21], . |
| 6. | var x: array [1..20] of real; , . , , . . |
| 7. | var x: array [1..20] of real; , . . |
| 8. | const n=20; var x: array [1..n] of integer; // n () . : var Mno: set of 0..255; : Type MasMno=array of set of 0..22; |
| 9. | 1,..n. 1,..n 1,.. n. r1,..,rn , rai=i i=1,..,n. |
|
|
|
3.2
| . | |
| 1. | var x: array [1..1000] of real; ( ), . ( . ̻ .1): hk-1=2*hk-1 (9,5,3,1), ht=1, t= [ log2n ] +1 |
| 2. | , , (, , : i: j=2*i j=2*i+1, hi≤hj) . |
| 3. | :
. 1
, . , , .
|
| 4. | (. 1) . ( ). |
| 5. | [-100100]. . ( - QuickSort) . TMemo. |
| 6. | , , ( , ) : var stack: array [1..30] of record Left, Right: integer; end; |
| 7. | . . |
| 8. | [-20..20]. , ( ). , ( ) . |
|
|
|
1. , .
2. .
3. . , .
4. , .
5. - .
6. ?
7. , , : -.
8. , .
9.
44 55 12 42 94 18 06 67
.
10. , ( ) .
11. .
12. .
13. i - , .
14. .
15. .
4
