Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8380615
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 9, 20262026-06-09T16:30:09+00:00 2026-06-09T16:30:09+00:00

0.0001*2^n + 10 * n^2 + 10000 * log(n) + 10000000 do we look

  • 0

0.0001*2^n + 10 * n^2 + 10000 * log(n) + 10000000

do we look at the highest exponent power?

The big O of this is O(n^2)? Am i right?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-09T16:30:11+00:00Added an answer on June 9, 2026 at 4:30 pm

    The big O of this is O(n^2)? Am i right?

    No, 2^n will be dominating over everything else, despite its tiny coefficient.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Why is this: console.log(1100 ^ 0001) => 1101 // as expected console.log(1100 ^ 1001)
I am using Datetime.Minvalue which return 1.1.0001. This value can not be stored to
My data is tab delimited and looks like this: Name Count Sample Dog .0001
about persp : x <- seq(.0001, 10000, by = (10000 - .0001) / 1000)
E_ALL equals 8191 ( 0001 1111 1111 1111 ) E_STRICT equals 2048 ( 0000
I have a file containing the information 0001:Jack:Jeremy:6:38.0 0002:Mat:Steve:1:44.5 0003:Jessy:Rans:10:50.0 0004:Van Red:Jimmy:3:25.75 0005:Peter:John:8:42.25 0006:Mat:Jeff:3:62.0
I have sentence like Q 000 1111 00001 0001 00 //SOME_STRING I wanted to
Is there a datatype within C# that if you put to for example 0001,
$datetime = new DateTime('0000-00-00 00:00:00'); $date_string = $datetime->format('Y-m-d H:i:s');//-0001-11-30 00:00:00 date gets turned from
So I'm just going to dive into this issue... I've got a heavily used

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.