The document discusses algorithms and their analysis. It introduces common algorithms like selection sort and nested for loops. It also covers big O notation for analyzing algorithms and describes how selection sort runs in O(n^2) time. Procedures and pseudocode are provided as examples.

1. ! " # $ % & ! " # $ % ' #" %
!
"# "#
" "
$
$
%
$
$
" "%
" "
& & & &
'
(
)
'
(
)
* '+ ,- ./
" " "
" "
"
&
0 &
0
123 &
0 4 5
&
6
&
7
&
/8 9:;<&
0 9:;&
0 (
)
7 $ 6
(= (
) >
>
>
>
( )
(
• ! " # " $ % &
• ' " # " ( ) "
• * " # " " % +
....
....
*+,
for (i=A to B)
... K ...
end for
*+,
for (i= to )
for (j=C to D)
... K
end for
end for
-
4 5 ?
-
@ A
(
)
-
@ A
B
C D
(
)
:
procedure SelectionSort(A)
for i=1 to n
pos=i
for j=i+1 to n
if (A[j]<A[pos])
pos=j
end if
end for
temp=A[i]; A[i]=A[pos]; A[pos]=temp
end for
end procedure
@ E EC % F E G EC %
E G $ E G $
E G $ E G E $ E
G E E $ E G $
%
F
."/ 0 1 01 2 / 3 / - @ F
) 4 0 1 ! % 5
(.)
(.) ,
« » .
( => , . .)
, (.)
! .
) -
)()1()( 22
nnnnnn Θ=+=+=Τ
)(
6
1
6
3
6
2
6
)12)((
6
)12)(1(
)( 323
2
nnnn
nnnnnn
n Θ=++=
++
=
++
=Τ
.
: