$->$ inkel

$3.$ Suppose an algorithm A for a graph problem yields e $($IV$|$ LOG$|$V$|)$ growth rate, another algorithm B for the same problem yields $/|$E$|+$ VI$)$ growth rate and the last algorithm C for the same problem yields eX$|$V$|$ LOG$|$El grouth rate. Compare the performance of these three algonths $($A$,$B and e$)$ for dense and sparse graphs. Indicate which one you would use for each care.

prims

derse