Member Avatar for ming97
ming97 0 Newbie Poster

Dear All

I knew that te formula of time optimal and cost optimal of prefix algorithm is p=teta(n/log n). But I have information that it is the same with n=omega(p log p).

I have some question :
1. is information true?
2. How about derive p=teta( n log n) to be n=omega(p log p)
3. can I derive n=omega(p log p) to another formula?

thanks.

regards,
ming

  • 1 Contributor
  • 0 Replies
  • 59 Views
Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.