complexity

This is a discussion on complexity within the C Programming forums, part of the General Programming Boards category; guys i have an exam tomorrow and i have no clue about complexity can u give me link about it ...

  1. #1
    Registered User
    Join Date
    Feb 2009
    Posts
    10

    complexity

    guys i have an exam tomorrow and i have no clue about complexity can u give me link about it i can read and learn as quick as possible?
    p.s=thank u very much for your help

  2. #2
    spurious conceit MK27's Avatar
    Join Date
    Jul 2008
    Location
    segmentation fault
    Posts
    8,300
    Try here.
    C programming resources:
    GNU C Function and Macro Index -- glibc reference manual
    The C Book -- nice online learner guide
    Current ISO draft standard
    CCAN -- new CPAN like open source library repository
    3 (different) GNU debugger tutorials: #1 -- #2 -- #3
    cpwiki -- our wiki on sourceforge

  3. #3
    and the Hat of Guessing tabstop's Avatar
    Join Date
    Nov 2007
    Posts
    14,185
    Quote Originally Posted by MK27 View Post
    Try here.
    No no no -- that's the link for recursion.

    Why don't you Google it? We don't keep a pile of links to ourselves to dole out when people ask nicely.

  4. #4
    Registered User
    Join Date
    Feb 2009
    Posts
    10
    i know u dont have a pile of links but i need an effectif link maybe u guys have..

  5. #5
    Registered User whiteflags's Avatar
    Join Date
    Apr 2006
    Location
    United States
    Posts
    7,661
    Of course! Complexity in computer science refers to the difficulty of an exam question or number of exam questions. Each question represents an equal part of the work such as a multiple choice, fill in the blank or a true or false answer. We assume that these will be answered in constant time, or, in Big-Oh notation, O(1).

    If you wanted to know the complexity of the whole exam, you could measure it in terms of the amount of work you have to do as the size grows. Commonly you will have to answer questions in linear time, or O(n). Sometimes you'll discover a question you answered wrong while checking your work, and need to repeat the steps. This usually ends up with a measurement like O(n^2) or if you're very unlucky O(n^3).

    Other people study and are able to answer the questions in subsets. They occasionally go back to the start of the test once they've finished a section of answers (like T/F). This means that the exam taking time is at most the height of the whole heap (or "recursion tree" as the technical term). These students regularly perform at O(n lg n).

    It is possible to go faster than O(n lg n) for test taking, but if you do, then you are a machine who is capable of answering questions in batches and having those answers be correct.
    Last edited by whiteflags; 06-03-2009 at 06:36 PM.

  6. #6
    Registered User
    Join Date
    Feb 2009
    Posts
    10
    thanks very much whiteflags but as u know this part of c programming so boring and gives me hard time to understand

  7. #7
    Banned ಠ_ಠ's Avatar
    Join Date
    Mar 2009
    Posts
    687
    Quote Originally Posted by whiteflags View Post
    Of course! Complexity in computer science refers to the difficulty of an exam question or number of exam questions. Each question represents an equal part of the work such as a multiple choice, fill in the blank or a true or false answer. We assume that these will be answered in constant time, or, in Big-Oh notation, O(1).

    If you wanted to know the complexity of the whole exam, you could measure it in terms of the amount of work you have to do as the size grows. Commonly you will have to answer questions in linear time, or O(n). Sometimes you'll discover a question you answered wrong while checking your work, and need to repeat the steps. This usually ends up with a measurement like O(n^2) or if you're very unlucky O(n^3).

    Other people study and are able to answer the questions in subsets. They occasionally go back to the start of the test once they've finished a section of answers (like T/F). This means that the exam taking time is at most the height of the whole heap (or "recursion tree" as the technical term). These students regularly perform at O(n lg n).

    It is possible to go faster than O(n lg n) for test taking, but if you do, then you are a machine who is capable of answering questions in batches and having those answers be correct.
    wow, that was a really good explanation
    ╔╗╔══╦╗
    ║║║╔╗║║
    ║╚╣╚╝║╚╗
    ╚═╩══╩═╝

  8. #8
    and the hat of sweating
    Join Date
    Aug 2007
    Location
    Toronto, ON
    Posts
    3,545
    Wouldn't your textbook talk about it?
    "I am probably the laziest programmer on the planet, a fact with which anyone who has ever seen my code will agree." - esbo, 11/15/2008

    "the internet is a scary place to be thats why i dont use it much." - billet, 03/17/2010

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Sorting (asymptotic) complexity problem
    By Petike in forum C++ Programming
    Replies: 8
    Last Post: 01-20-2009, 06:15 AM
  2. Algorithm Complexity
    By logicwonder in forum C Programming
    Replies: 4
    Last Post: 01-09-2006, 05:03 AM
  3. Worst-case complexity of this function?
    By Ariod in forum C Programming
    Replies: 3
    Last Post: 08-17-2005, 02:17 PM
  4. question on time complexity
    By blue_gene in forum C++ Programming
    Replies: 10
    Last Post: 05-16-2004, 05:09 AM
  5. Algorithm - Complexity.
    By visitant... in forum C Programming
    Replies: 5
    Last Post: 05-13-2003, 02:24 AM

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21