Related Work and Important Results AlgorithmTime Complexity Msg Complexity LCR ('79)O(n)O(n 2 ) HS ('80)O(n)O(nlogn) Our AlgorithmO(n)O(nlogn) (better constant) Lower boundΩ(n) (trivial)Ω(nlogn) FL ('87)
{"Image DocumentName": "Related Work and Important Results", "Image ImageDescription": "Algorithm. Time Complexity. Msg Complexity. LCR (\u201879) O(n) O(n2) HS (\u201980) O(nlogn) Our Algorithm. O(nlogn) (better constant) Lower bound. \u03a9(n) (trivial) \u03a9(nlogn) FL (\u201987) Franklin, Dolev- Klawe- Rodeh, Peterson, \u03b4\u03b9\u03ba\u03cc\u03c2 \u03bc\u03bf\u03c5.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}