sorry I made a mistake, ur algorithm is not bad comparing to

来源: yellowlemon 于 2008-02-13 08:26:16 [] [旧帖] [给我悄悄话] 阅读数 : (47 bytes)
回答: about max and min in an array 由 sub101 于 2008-02-13 07:15:12

quick sort. I forgot the quick sort complexity.

所有跟帖： 

• sort >= O(nlogn) -Jamesxu- ♂ 给 Jamesxu 发送悄悄话 (0 bytes) () 02/13/2008 postreply 08:28:12

• yes, right. long time did not pick up algorithms book coz -yellowlemon- ♀ 给 yellowlemon 发送悄悄话 (91 bytes) () 02/13/2008 postreply 08:30:24

请您先登陆，再发跟帖！