Higher Inverse Order O(n) Explained

Context: Undergrad
Thread starter terp.asessed
Start date Jan 25, 2015
Tags

Inverse

Join the discussion

Registration is free. Ask a follow-up in this thread, or start your own.

1 reply · 1K views

terp.asessed

Thread starter
Jan 25, 2015

What is higher inverse orders of n, as symbolized by O(n)? Please explain this to me---I am still confused even if googling it.

Discussion

Mathematics news on Phys.org

Math shows why your vote may not count the way you think it does
Research cautions that sometimes working together can actually spur inequality
A new 'golden age' of mathematics may be dawning, thanks to AI and human ingenuity

Simon Bridge

Science Advisor

Homework Helper

Jan 26, 2015

O(n) would be "order of n". See "big O notation".
The "order" is the power of 10. So 1000 is order 3.

An inverse order would be the negative power of 10... but I need the context.

Higher Inverse Order O(n) Explained

Discussion

Undergrad Is infinity a necessary concept?

High School Ant on a stretchy rope puzzle

High School Potato paradox

Undergrad Descartes’ Geometry of Square Roots

High School Three Squares Problem

Mathematica NDSolve with forcing function via "digital waveguide"

MATLAB Unable to produce desired results using state-space model with observer for inverted pendulum

Insights Revisiting the Velocity-Time Function

Insights Remote Operated Gate Control System

Insights AI Enriched Problem Solving

Insights Thinking Outside The Box Versus Knowing What’s In The Box

Insights Why Entangled Photon-Polarization Qubits Violate Bell’s Inequality

Insights Quantum Entanglement is a Kinematic Fact, not a Dynamical Effect

Higher Inverse Order O(n) Explained

Discussion

Similar threads

Simplifying Expression: $(-1)^n/(4^n)n(-4)^n$ - Explained

Undergrad Integrate f(t) from 0 to 1/n: Explained

Can an O(n) algorithm's actual growth rate exceed n?

Explaining Proof of Quick-Sort's O(nlog n) Expected Running Time

Proving log(n)^3 = O(n^(1/3)) using Big O notation

Undergrad Explore Higher Order Operators

Graduate Understanding Higher Order Poles in Conformal Transformations

Solve Network Programming Challenge: O(n^3) & Linear Time Solutions

Solving the Group O(n) Generator Problem

Graduate Robertson-Walker metric in higher dimensions (and problematic Riemann tensor)