Study Guides (380,000)
CA (150,000)
UTSG (10,000)
CSC (300)
Final

# CSC263H1 Study Guide - Final Guide: Priority Queue, Topological Sorting, Quadratic Probing

Department
Computer Science
Course Code
CSC263H1
Professor
Toniann Pitassi
Study Guide
Final

This preview shows pages 1-2. to view the full 7 pages of the document.
 

o

 
o!"
#\$%
#&' \$( 
)*\$+&*
,"\$"
\$%
%"-\$)
. /*edges
o0
,\$1*-
,\$1* 
 
\$ 
%)
,2"*-
# "**
!345
,2"
!36
#365
-7.
,2"*&8
9:45
3' 2
-;0
,<2=
.;0 
 ,<=2

!
>?)
%?)
5 *-@
A B3)C
, *
o/3 
o)'** 
 

Only pages 1-2 are available for preview. Some parts have been intentionally blurred.

o1"&"D
(&,"B3)
o*"
o*"*
o,"""*'
*
o**total # of pairs &\$5
O(n^2)
(B3)""
*'*' 
o, &,"B3)
9
,"*<5E=
FG292*@'
X=
i=1
n
j=i+1
n
Xij
Pr
(
ijare compared
)
=¿
(¿2
ji+1)
j=i+1
n
¿
E[X]=
i=1
n
¿
O(nlogn)
1*HB3)
o(O(nlogn)
, *
o*8""I 
o*-"
-*"*
 ,*H,"@
!*-"sequence of operations
, J
o, &""one operation
Worstcase sequence complexity
M
o-*** 
J*
,  
o)*"*
, 
o)* 
