FAQs
Search
Recent Topics
Flagged Topics
Hot Topics
Best Topics
Register / Login
Win a copy of
TensorFlow 2.0 in Action
this week in the
Artificial Intelligence and Machine Learning
forum!
Post Reply
Bookmark Topic
Watch Topic
New Topic
programming forums
Java
Mobile
Certification
Databases
Caching
Books
Engineering
Micro Controllers
OS
Languages
Paradigms
IDEs
Build Tools
Frameworks
Application Servers
Open Source
This Site
Careers
Other
all forums
this forum made possible by our volunteer staff, including ...
Marshals:
Campbell Ritchie
Liutauras Vilda
Paul Clapham
Bear Bibeault
Jeanne Boyarsky
Sheriffs:
Ron McLeod
Tim Cooke
Devaka Cooray
Saloon Keepers:
Tim Moores
Tim Holloway
Jj Roberts
Stephan van Hulst
Carey Brown
Bartenders:
salvin francis
Scott Selikoff
fred rosenberger
Forum:
Go
Question about book Learn Data Structures and Algorithms with Golang
Samruddha Shahasane
Greenhorn
Posts: 3
posted 1 year ago
What is the Big O notation?
Bhagvan Kommadi
Author
Posts: 75
5
posted 1 year ago
Big O notation is defining an upper bound of an algorithm. it bounds a function only from above. the time complexity of Insertion sort is O(n^2). O(n^2) covers linear time.
Rob Spoor
Sheriff
Posts: 22028
108
I like...
posted 1 year ago
1
O(n^2) is not linear, that's O(n). O(n^2) is quadratic. See also
https://en.wikipedia.org/wiki/Big_O_notation#Orders_of_common_functions
.
SCJP 1.4 - SCJP 6 - SCWCD 5 - OCEEJBD 6 - OCEJPAD 6
How To Ask Questions
How To Answer Questions
That's my roommate. He's kinda weird, but he always pays his half of the rent. And he gave me this tiny ad:
the value of filler advertising in 2020
https://coderanch.com/t/730886/filler-advertising
reply
reply
Bookmark Topic
Watch Topic
New Topic
Boost this thread!
Similar Threads
Data Structures and Algorithms with Golang
Learn Data Structures and Algorithms with Golang
* Welcome Bhagvan Kommadi
What are the important algorithms and data structures I really need to know?
How can one get expertise at data structures and algorithms?
More...