Thread: Homework help - Algorithm complexity
View Single Post
  #3 (permalink)  
Old 09-08-2008, 12:33 PM
WingedPanther's Avatar   
WingedPanther WingedPanther is offline
Super Moderator
  
Join Date: Jul 2006
Age: 35
Posts: 4,092
Last Blog:
Why Learn Data Structu...
Credits: 28
Rep Power: 45
WingedPanther is a splendid one to beholdWingedPanther is a splendid one to beholdWingedPanther is a splendid one to beholdWingedPanther is a splendid one to beholdWingedPanther is a splendid one to beholdWingedPanther is a splendid one to beholdWingedPanther is a splendid one to behold
Default Re: Homework help - Algorithm complexity
O(log(n^2)) is actually O(2*log(n)) or O(log(n)). A typical algorithm of this complexity is a binary search.
__________________
CodeCall Blog | CodeCall Wiki | Shareware | Linux Forum
Programming is a branch of mathematics.
Reply With Quote