Purchase Solution

C++ big O notation

Not what you're looking for?

Ask Custom Question

What does "n" represent in relation to big O notation? In other words, what does it mean? Like in O(n). I need a definition of what n is in words.

Purchase this Solution
Solution Summary

The solution discusses and defines what the "n" represents in relation to the big O notation.

Solution Preview

Big O notation is used throughout computer science to show how algorithms behave as their inputs grow larger. It is not specific to C++; it is useful in all programming languages and in theoretical computer science.

The idea is to summarize how many steps an algorithm takes to run. But instead of just saying a number like 1,000, big O notation gives the answer as a function, for example O(n^2). Here, "n" is the size of the input to the algorithm and the algorithm takes approximately n^2 steps to run. This is much more useful than just having a single data point, such as "when the input has size 30, the algorithm takes 900 steps to run." We'd much rather have a function giving the number steps of running time for every possible input size.

For example, take ...

Purchase this Solution
Free BrainMass Quizzes
Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

Basic Networking Questions

This quiz consists of some basic networking questions.

Javscript Basics

Quiz on basics of javascript programming language.

Inserting and deleting in a linked list

This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.

Word 2010: Tables

Have you never worked with Tables in Word 2010? Maybe it has been a while since you have used a Table in Word and you need to brush up on your skills. Several keywords and popular options are discussed as you go through this quiz.

View More Free Quizzes
Related BrainMass Solutions

  • Analying the algorithmic complexity of arithmetic operations

    It then describes and explains the complexity of the algorithms in big-o notation.

  • Using Big O notation

    Using Big O notation is emphasized.

  • Big O

    65093 Big O notation I) Show that x^3 is O(x^4) but x^4 is not O(x^3) ii)Show that xlnx is O(x^2) but x^2 is not O(xlnx) iii)Show that a^x O(b^x) but b^x is not O(a^x) if 0 < a < b (0 = zero) iv)Show that 1^k + 2^k+...

  • Analyzing the complexity of addition and multiplication

    285634 Big O notation Use big-O notation to classify the traditional grade school algorithms for addition and multiplication. That is, if asked to add two numbers each having N digits, how many individual additions must be performed?

  • Set-Builder Notation

    For example, set O={1,3,5.7.9} or D={Mon, Tu, Wed, Th, Fri}. The set-builder notation formally looks like this: C={x | the description of the typical element x of the set}.

  • Definition of small O-notation

    8631 Definition of small O-notation See the attach file for problem. Please read R as R+ Question : Prove that ! ( ) n n ∈ο n by using the definition of the small o- notation.

  • Solving a recurrence

    T(2) = 1 T(n) = 2T(n^(1/2)) + log n Express your answer as simply as possible using theta notation. note added ** theta notation is based on big O notation Show all work!

  • String function evaluation and algorithm analysis

    Explain your answer and result 2) Use big-O notation to classify the traditional grade school algorithms for addition and multiplication. That is, if asked to add two numbers each having N digits, how many individual additions must be performed?

  • 1 label code, 2 determine time complexity of code segments ,

    For bonus points, show the runtime of each code segment in Big O notation. a. for (int y = 0; y < n; y++) { for (int x = 0; x < n; x++) { m[y, x] = 0; } } b.

View More Related Solutions