Order statistics Select the ith smallest of n elements(the element with rank i i=l: minimum, .i=n: marimum, i=L(n+1)/2]or[(n+1)/2 median Naive algorithm: Sort and index ith element Worst-case running time =o(n Ig n)+o(1 o(nIg n using merge sort or heapsort(not quicksort) c 2001 by Charles E Leiserson
chapter 9 GRAPH ALGORITHMs $I Definitions e G(V,E) where G: =graph, V=V(G): :=finite nonempty set of vertices, andE=E(G): : = finite set of edges. d' Undirected graph:(V;,vi)=(j,vi): =the same edge 6 Directed graph(digraph): :=2* I tailhead
Unit 6 I. Basic listening practice 1. Script W: Are those cigarettes yours? I thought you quit. If you go back to it, your teeth and fingers will be nicotine-Stained; your breath and clothes will smell smoky M: I didnt. I swear. Ads showing diseased lungs kept me from starting again. Believe
Uint I. Basic listening practice 1. Script W: Have you chosen your elective for next semester yet? Are you taking Frenc riting again? M: Yes I am, but it's compulsory for us next semester. So i think I'm gong to do marketing as an elective instead