0 votes 0 votes Graph Theory graph-theory made-easy-test-series + – eyeamgj asked Nov 21, 2018 • retagged Oct 10, 2023 by Hira Thakur eyeamgj 254 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply gauravkc commented Nov 21, 2018 reply Follow Share $O(n^2logn)$? Since we have to do sorting every time in Havel-Hakimi until left with zeros. 1 votes 1 votes eyeamgj commented Nov 21, 2018 reply Follow Share ok thank u so much 0 votes 0 votes Hemanth_13 commented Nov 21, 2018 reply Follow Share To decrease O(n) To sort O(nlogn) Total O($n^2$ $logn$) 0 votes 0 votes Please log in or register to add a comment.
