Thread: Approximations on time complexity

  1. #1
    Registered User
    Join Date
    Apr 2015
    Posts
    485

    Approximations on time complexity

    Hi guys; I'm confused about something and I hope I get a fulfill answer..
    If I have T(upper.bound(n/2)) as we are approximating it as T(n/2); my question why specifically we approximating it to n/2 and not for instance to n/4? It's also an approximate to upper.bound(n/2)


    Thanks

  2. #2
    Registered User
    Join Date
    Apr 2015
    Posts
    485
    Any help guys?! thanks

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Time Complexity
    By ARYAA in forum C Programming
    Replies: 5
    Last Post: 07-06-2016, 03:22 AM
  2. Time complexity.
    By RyanC in forum C Programming
    Replies: 1
    Last Post: 07-10-2015, 01:18 PM
  3. Time complexity of algorithm
    By viblic in forum C Programming
    Replies: 2
    Last Post: 01-11-2012, 11:22 AM
  4. Time Complexity
    By Stuart Dickson in forum C Programming
    Replies: 7
    Last Post: 07-20-2010, 03:13 AM
  5. question on time complexity
    By blue_gene in forum C++ Programming
    Replies: 10
    Last Post: 05-16-2004, 05:09 AM

Tags for this Thread