(

1.

<

_ ...
<

>
< >
< >
_

>

_
_

,


< >


,

, _
_

_



_
2.

<
<
_

,
_

<

<
_

...

<

<

<=

>
< >
_

>
< > <=
< >
< > <
_

<

<

> +

>

<

< >

_
_

. ' ,

, '
_


,
< >
_ .

>

,
< >

_ ,

,


>

>
_
< >
_
_

_
< >
< >
_
_
< >

<

>

5,

, '

,

,

' .

>

_


. '

<

>

_
,

_



_

_

_

>

>
_
<

>=

>
< >
_

<

>
< > >=
< >
< > <
_

> +

.
1



_

<
.

_

<


.

_

,
< >

...,

>

>

.



....

,
.
.

,
,

,

.




.

, .



,



,

. ,





.
,



,

.

,
, .

,

. ,

,

. ,
,


.

.

'

,

,

, '

, .
,

.

inary sear h

.

.

,
.

,


,


.

.. . ,
,

.
2







,

.
,

" "






.
_

: A[20], ,
, , key, i
: done

' '
i 1 20
A[i]
_

key
1
20
done

( <=
) (done =
)
( +
) div 2
A[ ] = key
done

A[ ] < key
+ 1

- 1
_
_
_

done =

_
_ _

1

.
2

15

22

27

35

37

38

40

43

45

47

.
3

10
100
1.000
10.000
100.000
1.000.000
10.000.000
100.000.000
1.000.000.000

4
7
10
14
17
20
24
27
30

"

/ ".
*

(selection sort)

sele tion sort ,

:

1.


2.

3.

Selection_Sort

=

: A[20], , , i, j

i 1
A[i]
_

i 1 -1
i
A[i]
j i + 1
> A[j]
j
A[j]
_
_

A[ ] A[i]
A[i]
_

i 1
A[i]
_

_ Selection_Sort

.
4

46
55

46

06

42

42

06

12

18

46

46

67

94

67

94

67

55

67

46

55

46

67

55

67

55

67

46

55

46

42

06

18

46

18

94

18

12

42

18

94

12

42

18

94

12

06

42

18
06
67
Sele tionSort

18

94

18

42

55

94

12

06

42

12

12

06

42
94

12

55

06

12

55

06

[ ]:

67

94

: , , , ,
, , ,

.
i)

top)
.
ii)

: , , ,
,

;
2)


,

.

.
3)

, , , , .

, , , ,

.
4)
,

.

.
1)

.
5

ii

1) i)

10
9
8
7
6
5
4
3
2
1

top
10
9
8
7
6
5
4
3
2
1

2)

i)

ii

3)

9
8
7
6
5
4
3
2
1

: , ,
, , , , ,
, , ,

:
10

ii)

= 7

4) i

:
=

10
9
8
7
6
5
4
3
2
1

= 1 = 5

= 5

:
,

,
,

,
, ,
,
,

1)

front

rear :

= 10.

A, M, D, K, L, B
.
:

,

;

.
6

2)

.




,

1)

A, M, D, K, L, B
:

_
< 10
+ 1
[ ] _

>= 1
[
top top - 1

:
: , [ ]
: done

'

, , top, done)
=

:
: , [ ]
: done

>=1
[ ]
1
done

done
_
_

,


,

. :

top <
+ 1
[ ]
done

done

_
_

done

.

2.

, , top, done)

'
'
_
_
:


, .

2)

,



,

1.

1.

2.

3.

"
/);".

.
7

3.
4.

,
, ,

.

,



,
.

: ,
:

,
, , K[ ]

0
_

'
'

' . '

' . '

' . '

'
:'

=1

'
/ ;'

_
= ' ' = ' '
=' '
<

+ 1
[ ]
=

'
'
_

'
'
_
_
_
=
= ' '

_
=2
0
>= 1

' ', [ ]
- 1
+1
_

' ',
_
_
=3
_

.
8


TREES

,




,
, ,

.
,


leaves . (branches).

.

.

Binary tree ,

degree .


. .

level

n
n
.
n8, n9, n5, n6 n7.
,
n
,

n n

graph

n , n , n .
n n
n .
.

.
9