с. п(п + 1)/2€ Ө(n) d. n(n + 1)/2 e N (n)

Enhanced Discovering Computers 2017 (Shelly Cashman Series) (MindTap Course List)
1st Edition
ISBN:9781305657458
Author:Misty E. Vermaat, Susan L. Sebok, Steven M. Freund, Mark Frydenberg, Jennifer T. Campbell
Publisher:Misty E. Vermaat, Susan L. Sebok, Steven M. Freund, Mark Frydenberg, Jennifer T. Campbell
Chapter3: Computers And Mobile Devices: Evaluating Options For Home And Work
Section: Chapter Questions
Problem 17SG
icon
Related questions
Question

Use the informal definitions of O, big theta, and big omega to determine whether the following assertions are true or false.

с. п(п + 1)/2 е Ө (n3)
d. n(n + 1)/2 e 2 (n)
Transcribed Image Text:с. п(п + 1)/2 е Ө (n3) d. n(n + 1)/2 e 2 (n)
Expert Solution
Solution for c)

Solution

c) n(n+1)/2 θ(n3)

     To prove the above statement we have to find  c1,cand n0 such that 0c1g(n)f(n)c2g(n) for all nn0

    here g(n)=n3

The assertion is true

      Computer Science homework question answer, step 1, image 1

hence

The assertion is true

 

 

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Binary numbers
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Enhanced Discovering Computers 2017 (Shelly Cashm…
Enhanced Discovering Computers 2017 (Shelly Cashm…
Computer Science
ISBN:
9781305657458
Author:
Misty E. Vermaat, Susan L. Sebok, Steven M. Freund, Mark Frydenberg, Jennifer T. Campbell
Publisher:
Cengage Learning