# Using Big O notation

Not what you're looking for?

Use only the definition of O(f(n)) to prove that the following statements are true:

1. (6n^3*log n + 1)/2n +1000 = O(1)

2. nlog n + n^3/2 = O(n^3/2)

Please view the attachment below for the full question.

##### Purchase this Solution

##### Solution Summary

Using Big O notation is emphasized.

##### Purchase this Solution

##### Free BrainMass Quizzes

##### C++ Operators

This quiz tests a student's knowledge about C++ operators.

##### Javscript Basics

Quiz on basics of javascript programming language.

##### C# variables and classes

This quiz contains questions about C# classes and variables.

##### Basic UNIX commands

Use this quiz to check your knowledge of a few common UNIX commands. The quiz covers some of the most essential UNIX commands and their basic usage. If you can pass this quiz then you are clearly on your way to becoming an effective UNIX command line user.

##### 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.