Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Big O notation
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia-live.demo.openlinksw.com
Form of Landau notation representing asymptotically equivalent or slower growth
Property
Value
dbo:
description
Notation zur Beschreibung des asymptotischen Verhaltens von Funktionen und Folgen
(de)
notasi untuk menggambarkan perilaku yang membatasi sebuah fungsi
(in)
wiskundige notatie
(nl)
étude du comportement d'une fonction au voisinage d'un point ou à l'infini
(fr)
数学関数の極限における値の変化度合いに大まかな評価を与えるための記法
(ja)
notação para descrever o comportamento assintótico de uma função
(pt)
form of Landau notation representing asymptotically equivalent or slower growth
(en)
notazione utilizzata per descrivere il comportamento asintotico delle funzioni
(it)
método de estudo da taxa de crecemento dunha función.
(gl)
нотація для запису асимтотичної поведінки функції
(uk)
dbo:
thumbnail
wiki-commons
:Special:FilePath/Big-O-notation.png?width=300
dbo:
wikiPageExternalLink
http://www.perlmonks.org/%3Fnode_id=573138
https://autarkaw.org/2013/01/30/making-sense-of-the-big-oh/
https://classes.soe.ucsc.edu/cse102/Fall21/Handouts/AsymptoticGrowth.pdf
https://discrete.gr/complexity/
https://web.archive.org/web/20181007223123/https:/autarkaw.org/2013/01/30/making-sense-of-the-big-oh/
https://archive.org/details/introductiontoth00sips_928
https://archive.org/details/introductiontoth00sips_928/page/n239
https://archive.org/details/ordersofinfinity00harduoft
http://www.andrew.cmu.edu/~avigad/Papers/bigo.pdf
https://stackoverflow.com/questions/487258/what-is-a-plain-english-explanation-of-big-o-notation/50288253%2350288253
http://mathworld.wolfram.com/LandauSymbols.html
http://oeis.org/wiki/Growth_of_sequences
https://xlinux.nist.gov/dads/HTML/bigOnotation.html
https://xlinux.nist.gov/dads/HTML/littleOnotation.html
https://xlinux.nist.gov/dads/HTML/omega.html
https://xlinux.nist.gov/dads/HTML/omegaCapital.html
https://xlinux.nist.gov/dads/HTML/theta.html
dbo:
wikiPageWikiLink
dbr
:Binomial_heap
dbr
:Tree_sort
dbr
:Interpolation_search
dbr
:Introduction_to_Algorithms
dbr
:File:Comparison_computational_complexity.svg
dbr
:File:Big-O-notation.png
dbr
:V:MyOpenMath/Solutions
dbr
:V:MyOpenMath/Solutions/Big-O
dbr
:Wikt:Ordnung
dbc
:Mathematical_notation
dbr
:Bubble_sort
dbr
:Edmund_Landau
dbr
:Lookup_table
dbr
:Laplace_expansion
dbr
:Disjoint-set_data_structure
dbr
:TeX
dbr
:Coefficient
dbr
:Normed_vector_space
dbr
:Argument_of_a_function
dbr
:Topological_group
dbr
:Clifford_Stein
dbr
:Complex_number
dbr
:Function_(mathematics)
dbr
:Omega
dbr
:Real_number
dbr
:Cambridge_University_Press
dbr
:Summand
dbr
:Absolute_value
dbr
:Factorial
dbr
:Insertion_sort
dbr
:Prime_number_theorem
dbr
:Convex_cone
dbr
:Quicksort
dbr
:Bell_number
dbr
:Matching_(graph_theory)
dbr
:Integral_transform
dbr
:Comparison_sort
dbr
:Analytic_number_theory
dbr
:Big_O_notation
dbc
:Analysis_of_algorithms
dbc
:Asymptotic_analysis
dbr
:Analysis_of_algorithms
dbr
:Quadratic_sieve
dbr
:Set_notation
dbr
:0
dbr
:Infinity
dbr
:Mathematics
dbr
:K-d_tree
dbr
:Infinitesimal
dbr
:Limit_inferior_and_limit_superior
dbr
:Nicolaas_Govert_de_Bruijn
dbr
:Big_O_in_probability_notation
dbr
:Fast_Fourier_transform
dbr
:Symmetric_relation
dbr
:Abuse_of_notation
dbr
:Algorithm
dbr
:Bipartite_graph
dbr
:Subset
dbr
:Thomas_H._Cormen
dbr
:Computer_science
dbr
:Donald_Knuth
dbr
:Omicron
dbr
:Determinant
dbr
:Charles_E._Leiserson
dbr
:Equivalence_relation
dbr
:Multiplication_algorithm
dbr
:Taylor_series
dbr
:Merge_sort
dbr
:Computational_complexity_theory
dbr
:Kirkpatrick–Seidel_algorithm
dbr
:Arithmetic_function
dbr
:Polygon_triangulation
dbr
:Nachbin's_theorem
dbr
:Paul_Gustav_Heinrich_Bachmann
dbr
:Transitive_relation
dbr
:John_Edensor_Littlewood
dbr
:Heapsort
dbr
:Partially_ordered_set
dbr
:Selection_sort
dbr
:Asymptotic_analysis
dbr
:Asymptotic_expansion
dbr
:Shellsort
dbr
:Exponential_function
dbr
:Bounded_set
dbr
:Master_theorem_(analysis_of_algorithms)
dbr
:Time_complexity
dbr
:Order_of_approximation
dbr
:Upper_and_lower_bounds
dbr
:L-notation
dbr
:Dynamic_programming
dbr
:Element_(mathematics)
dbr
:Brute-force_search
dbr
:Limit_point
dbr
:Net_(mathematics)
dbr
:Derivative
dbr
:Travelling_salesman_problem
dbr
:LU_decomposition
dbr
:Extended_real_number_line
dbr
:Tree-adjoining_grammar
dbr
:Asymptotically_optimal_algorithm
dbr
:Integer_factorization
dbr
:Computational_complexity_of_mathematical_operations
dbr
:Parallel_random-access_machine
dbr
:Number_field_sieve
dbr
:Polynomial_time
dbr
:Exponential_time
dbr
:Constant_time
dbr
:Linear_time
dbr
:Sub-exponential_time
dbr
:Upper_bound
dbr
:Ronald_L._Rivest
dbr
:Limit_superior
dbr
:Linearithmic_time
dbr
:Orders_of_approximation
dbr
:Paul_Bachmann
dbr
:Ivan_Matveyevich_Vinogradov
dbr
:Binary_search_algorithm
dbr
:Filter_base
dbr
:Chebyshev_norm
dbr
:Natural_numbers
dbr
:Differentiability
dbr
:Cluster_point
dbr
:Complex_analytic
dbr
:Log-star
dbr
:Logarithmic_time
dbr
:Godfrey_Harold_Hardy
dbr
:Quadratic_time
dbr
:Polylogarithmic_time
dbr
:Ripple_carry_adder
dbr
:Tree_data_structure
dbp:
project
wikiversity
(en)
dbp:
text
Wikiversity solved a MyOpenMath problem using Big-O Notation
(en)
dbp:
wikiPageUsesTemplate
dbt
:Dark_mode_invert
dbt
:Cite_book
dbt
:Cite_web
dbt
:Reflist
dbt
:Notelist
dbt
:Redirect
dbt
:Math
dbt
:=
dbt
:Anchor
dbt
:Wikibooks
dbt
:Original_research_inline
dbt
:Cite_conference
dbt
:Further
dbt
:Sister_project
dbt
:Citation_needed
dbt
:Usurped
dbt
:Mvar
dbt
:Em
dbt
:-"
dbt
:Abs
dbt
:Snd
dbt
:Efn
dbt
:Order-of-approx
dbt
:Short_description
dbt
:Blockquote
dct:
subject
dbc
:Mathematical_notation
dbc
:Analysis_of_algorithms
dbc
:Asymptotic_analysis
rdfs:
label
Big O notation
(en)
Notació de Landau
(ca)
تمثيل O الكبرى
(ar)
Landauova notace
(cs)
Landau-Symbole
(de)
Granda O
(eo)
Cota superior asintótica
(es)
Goi borne asintotiko
(eu)
O-grande
(it)
Notasi O besar
(in)
Comparaison asymptotique
(fr)
ランダウの記号
(ja)
점근 표기법
(ko)
Grote-O-notatie
(nl)
Asymptotyczne tempo wzrostu
(pl)
Grande-O
(pt)
«O» большое и «o» малое
(ru)
Ordo
(sv)
Нотація Ландау
(uk)
大O符号
(zh)
owl:
sameAs
freebase
:Big O notation
yago-res
:Big O notation
wikidata
:Big O notation
dbpedia-it
:Big O notation
dbpedia-nl
:Big O notation
dbpedia-de
:Big O notation
dbpedia-fr
:Big O notation
dbpedia-tr
:Big O notation
dbpedia-zh
:Big O notation
dbpedia-ja
:Big O notation
dbpedia-pt
:Big O notation
dbpedia-he
:Big O notation
dbpedia-ro
:Big O notation
dbpedia-es
:Big O notation
dbpedia-hu
:Big O notation
dbpedia-fa
:Big O notation
dbpedia-ru
:Big O notation
dbpedia-sv
:Big O notation
dbpedia-vi
:Big O notation
dbpedia-pl
:Big O notation
dbpedia-ko
:Big O notation
dbpedia-id
:Big O notation
dbpedia-be
:Big O notation
dbpedia-ca
:Big O notation
dbpedia-ar
:Big O notation
dbpedia-az
:Big O notation
dbpedia-bn
:Big O notation
dbpedia-cs
:Big O notation
dbpedia-eo
:Big O notation
dbpedia-eu
:Big O notation
dbpedia-hi
:Big O notation
dbpedia-ka
:Big O notation
dbpedia-no
:Big O notation
dbpedia-simple
:Big O notation
dbpedia-sl
:Big O notation
dbpedia-sr
:Big O notation
dbpedia-th
:Big O notation
dbpedia-uk
:Big O notation
dbpedia-global
:Big O notation
dbr
:Big O notation
prov:
wasDerivedFrom
wikipedia-en
:Big_O_notation?oldid=1293923037&ns=0
foaf:
depiction
wiki-commons
:Special:FilePath/Comparison_computational_complexity.svg
wiki-commons
:Special:FilePath/Big-O-notation.png
foaf:
isPrimaryTopicOf
wikipedia-en
:Big_O_notation
is
dbo:
knownFor
of
dbr
:G._H._Hardy
is
dbo:
wikiPageDisambiguates
of
dbr
:Big_O
is
dbo:
wikiPageRedirects
of
dbr
:Big-Theta_Notation
dbr
:Big_Omega_notation
dbr
:Landau_notation
dbr
:Little_o_notation
dbr
:Bachmann–Landau_notation
dbr
:Hardy_notation
dbr
:Hardy_notation
dbr
:Onotation
dbr
:Order_notation
dbr
:Order_of
dbr
:Order_of_a_sequence
dbr
:O()
dbr
:O(1)
dbr
:O(2ⁿ)
dbr
:O(n!)
dbr
:O(nˆ2)
dbr
:O-notation
dbr
:O-speedup
dbr
:O-symbol
dbr
:O_notation
dbr
:Bachmann-Landau_notation
dbr
:Theta_notation
dbr
:Big-O_Notation
dbr
:Big-O_complexity
dbr
:Big-O_notation
dbr
:Big-Theta
dbr
:Big-o_notation
dbr
:Big-oh
dbr
:Big-omega_notation
dbr
:Big-theta_notation
dbr
:Big_O_Notation
dbr
:Big_Oh
dbr
:Big_Oh_notation
dbr
:Big_Theta
dbr
:Big_Theta_notation
dbr
:Big_o_notation
dbr
:Big_oh
dbr
:Big_oh_notation
dbr
:Big_omega_notation
dbr
:Big_omicron_notation
dbr
:Big_theta
dbr
:Big_theta_notation
dbr
:Big_Ο_notation
dbr
:Bigonotation
dbr
:Constant_factor
dbr
:Constant_factors
dbr
:Small_o_notation
dbr
:Soft_O
dbr
:Soft_O_notation
dbr
:Landau's_symbol
dbr
:Landau_gauge_symbol
dbr
:Landau_symbol
dbr
:Landau_symbols
dbr
:Asymptotic_Growth_of_Functions
dbr
:Asymptotic_bound
dbr
:Asymptotic_growth_of_functions
dbr
:Asymptotic_lower_bound
dbr
:Asymptotic_notation
dbr
:Asymptotic_run_time
dbr
:Asymptotic_running_time
dbr
:Asymptotic_upper_bound
dbr
:Asymptotically_tight_bound
dbr
:Little-o
dbr
:Little-o_notation
dbr
:Little_O
dbr
:Little_O_notation
dbr
:Little_o
dbr
:Little_oh
dbr
:Little_ο_notation
dbr
:T(n)
dbr
:Properties_of_O_and_o
is
dbo:
wikiPageWikiLink
of
dbr
:Total_derivative
dbr
:Fermat_primality_test
dbr
:Index_of_computing_articles
dbr
:Autocorrelation
dbr
:Baby-step_giant-step
dbr
:Linear_search
dbr
:Distributed_hash_table
dbr
:Knapsack_problem
dbr
:Tree_sort
dbr
:Smith–Waterman_algorithm
dbr
:Interpolation_search
dbr
:NC_(complexity)
dbr
:Gauss_circle_problem
dbr
:Space_complexity
dbr
:Planar_separator_theorem
dbr
:Planarity_testing
dbr
:Nonobtuse_mesh
dbr
:SUPS
dbr
:X_+_Y_sorting
dbr
:Minimum_degree_algorithm
dbr
:Pairwise_summation
dbr
:Farthest-first_traversal
dbr
:Cullen_number
dbr
:Einstein–Infeld–Hoffmann_equations
dbr
:Optimal_binary_search_tree
dbr
:Order-maintenance_problem
dbr
:Shadow_heap
dbr
:Total_functional_programming
dbr
:Jacobi_symbol
dbr
:Minimum_spanning_tree
dbr
:Õ
dbr
:Bidirectional_search
dbr
:Bubble_sort
dbr
:Edmund_Landau
dbr
:Harmonic_series_(mathematics)
dbr
:Riemann_series_theorem
dbr
:Curvature
dbr
:P_versus_NP_problem
dbr
:Summation
dbr
:Università_della_Svizzera_italiana
dbr
:Logarithmic_integral_function
dbr
:True_quantified_Boolean_formula
dbr
:One-way_function
dbr
:Simpson's_rule
dbr
:Counting_sort
dbr
:Cesàro_summation
dbr
:Laplace's_method
dbr
:Laplace_expansion
dbr
:Approximate_string_matching
dbr
:Legendre's_conjecture
dbr
:Shapiro_time_delay
dbr
:Disjoint-set_data_structure
dbr
:Schwarz_triangle_function
dbr
:Schönhage–Strassen_algorithm
dbr
:Discrete_wavelet_transform
dbr
:Gaussian_elimination
dbr
:Huffman_coding
dbr
:Inductance
dbr
:Invertible_matrix
dbr
:Move-to-front_transform
dbr
:TeX
dbr
:Lambda_calculus
dbr
:List_of_mathematical_symbols_by_subject
dbr
:Self-balancing_binary_search_tree
dbr
:Prime_number
dbr
:Square-free_integer
dbr
:Graph_database
dbr
:Context-free_language
dbr
:Ham_sandwich_theorem
dbr
:Runge–Kutta_methods
dbr
:Scalability
dbr
:Vojtěch_Jarník
dbr
:Cumulant
dbr
:Erdős_distinct_distances_problem
dbr
:Unit_distance_graph
dbr
:Hamiltonian_path_problem
dbr
:Blossom_algorithm
dbr
:List_of_limits
dbr
:Chebyshev_function
dbr
:Sequential_access
dbr
:Smoothsort
dbr
:Real_closed_field
dbr
:Solovay–Strassen_primality_test
dbr
:Dancing_Links
dbr
:Sieve_of_Sundaram
dbr
:Eventually_(mathematics)
dbr
:Longest_increasing_subsequence
dbr
:Exponential_sum
dbr
:List_of_algorithm_general_topics
dbr
:List_of_terms_relating_to_algorithms_and_data_structures
dbr
:Logarithm
dbr
:Omega
dbr
:Pythagorean_theorem
dbr
:Jacobian_matrix_and_determinant
dbr
:Factorial
dbr
:Karatsuba_algorithm
dbr
:Positronium
dbr
:Priority_queue
dbr
:Generation_of_primes
dbr
:Ropelength
dbr
:SUHA_(computer_science)
dbr
:Parallel_computation_thesis
dbr
:AKS_primality_test
dbr
:APL_(programming_language)
dbr
:AVL_tree
dbr
:Insertion_sort
dbr
:Harshad_number
dbr
:String-searching_algorithm
dbr
:Formal_grammar
dbr
:Prime_number_theorem
dbr
:Bitap_algorithm
dbr
:Ordo
dbr
:Cramér's_conjecture
dbr
:R-parity
dbr
:Richardson_extrapolation
dbr
:Schur_decomposition
dbr
:Computational_geometry
dbr
:Quadratic_residue
dbr
:Analysis_of_parallel_algorithms
dbr
:EXPTIME
dbr
:E_(complexity)
dbr
:Emptiness_problem
dbr
:Separable_filter
dbr
:Periodic_continued_fraction
dbr
:Landau–Ramanujan_constant
dbr
:Universal_Turing_machine
dbr
:ESPACE
dbr
:Euclidean_minimum_spanning_tree
dbr
:Fast_Walsh–Hadamard_transform
dbr
:Fortune's_algorithm
dbr
:Bareiss_algorithm
dbr
:Dickman_function
dbr
:Maximum_term_method
dbr
:Link/cut_tree
dbr
:NE_(complexity)
dbr
:Stemloc
dbr
:O(1)_scheduler
dbr
:O(n)
dbr
:O(n)_scheduler
dbr
:Worst-case_complexity
dbr
:2-EXPTIME
dbr
:Big-Theta_Notation
dbr
:Big_O_notation
dbr
:Big_Omega_notation
dbr
:Landau_notation
dbr
:Little_o_notation
dbr
:Legendre's_constant
dbr
:Amortized_analysis
dbr
:Analysis_of_algorithms
dbr
:Omega_function
dbr
:Special_number_field_sieve
dbr
:Dini_test
dbr
:Game_complexity
dbr
:Percolation_theory
dbr
:Dreidel
dbr
:Gnome_sort
dbr
:Painter's_algorithm
dbr
:Quadtree
dbr
:Preorder
dbr
:DSPACE
dbr
:Nearest_neighbor_graph
dbr
:Skellam_distribution
dbr
:History_of_mathematical_notation
dbr
:Range_searching
dbr
:Stable_roommates_problem
dbr
:Erdős–Pósa_theorem
dbr
:Marzullo's_algorithm
dbr
:Linux_kernel
dbr
:Schulze_method
dbr
:Epoll
dbr
:K-d_tree
dbr
:Infinitesimal
dbr
:Tetration
dbr
:Voronoi_diagram
dbr
:Convergence_of_Fourier_series
dbr
:Tower_of_Hanoi
dbr
:Fibonacci_heap
dbr
:Perlin_noise
dbr
:Combinatory_logic
dbr
:Transitive_closure
dbr
:Romberg's_method
dbr
:Multiply_perfect_number
dbr
:Pohlig–Hellman_algorithm
dbr
:Stooge_sort
dbr
:Allen_Telescope_Array
dbr
:Closest_pair_of_points_problem
dbr
:Derangement
dbr
:Gradient_descent
dbr
:The_Complexity_of_Songs
dbr
:Extension_complexity
dbr
:Factorization_of_polynomials_over_finite_fields
dbr
:Betweenness_centrality
dbr
:Island_algorithm
dbr
:Alpha–beta_pruning
dbr
:Fast_Fourier_transform
dbr
:Galactic_algorithm
dbr
:Nondeterministic_finite_automaton
dbr
:Divide-and-conquer_algorithm
dbr
:Tournament_(graph_theory)
dbr
:CYK_algorithm
dbr
:Bayesian_information_criterion
dbr
:Bellman–Ford_algorithm
dbr
:Bin_packing_problem
dbr
:Range_tree
dbr
:Mertens_function
dbr
:Star-shaped_polygon
dbr
:Clique_problem
dbr
:Double-ended_queue
dbr
:Geometrical_properties_of_polynomial_roots
dbr
:Mertens'_theorems
dbr
:Algorithmic_efficiency
dbr
:Edmonds–Karp_algorithm
dbr
:Spoke–hub_distribution_paradigm
dbr
:Albertson_conjecture
dbr
:Brooks–Iyengar_algorithm
dbr
:Glossary_of_engineering:_A–L
dbr
:Greek_letters_used_in_mathematics,_science,_and_engineering
dbr
:Primality_certificate
dbr
:Riesz_function
dbr
:Algorithm
dbr
:Prime-counting_function
dbr
:Snapshot_(computer_storage)
dbr
:Product_rule
dbr
:Binary_logarithm
dbr
:Database_index
dbr
:Perturbation_theory
dbr
:Asymptote
dbr
:Coupon_collector's_problem
dbr
:Limit_(mathematics)
dbr
:Sieve_of_Eratosthenes
dbr
:Red–black_tree
dbr
:Arbitrary-precision_arithmetic
dbr
:Kademlia
dbr
:Landau's_function
dbr
:Polylogarithmic_function
dbr
:Ramer–Douglas–Peucker_algorithm
dbr
:Matrix_multiplication_algorithm
dbr
:Wagner–Fischer_algorithm
dbr
:Chemical_database
dbr
:Chvátal_graph
dbr
:Magma_(computer_algebra_system)
dbr
:Rader's_FFT_algorithm
dbr
:Proximity_problems
dbr
:De_Boor's_algorithm
dbr
:Eigenvalue_perturbation
dbr
:Cereceda's_conjecture
dbr
:Computer_engineering_compendium
dbr
:Donald_Knuth
dbr
:Omicron
dbr
:Theta
dbr
:Recursion_(computer_science)
dbr
:Arnold_Schönhage
dbr
:Associative_array
dbr
:Determinant
dbr
:List_of_pioneers_in_computer_science
dbr
:Splay_tree
dbr
:The_Art_of_Computer_Programming
dbr
:Arnold_Walfisz
dbr
:Cantor's_first_set_theory_article
dbr
:Series_expansion
dbr
:Worst-case_execution_time
dbr
:Lisp_(programming_language)
dbr
:Multiplication_algorithm
dbr
:Taylor_series
dbr
:Dynamic_array
dbr
:Akra–Bazzi_method
dbr
:Regular_number
dbr
:Singular_value_decomposition
dbr
:Best,_worst_and_average_case
dbr
:Euler's_totient_function
dbr
:Merge_sort
dbr
:Regular_expression
dbr
:2-choice_hashing
dbr
:Computational_complexity_theory
dbr
:Euclid's_theorem
dbr
:Euclidean_algorithm
dbr
:Riemann_hypothesis
dbr
:Erdős–Szemerédi_theorem
dbr
:Adaptive_sort
dbr
:Sylvester_equation
dbr
:Boyer–Moore–Horspool_algorithm
dbr
:Sort-merge_join
dbr
:Longest_common_subsequence_problem
dbr
:Longest_common_substring_problem
dbr
:Bachmann–Landau_notation
dbr
:Knuth–Morris–Pratt_algorithm
dbr
:Polynomial_interpolation
dbr
:Rubik's_Cube
dbr
:Accounting_method_(computer_science)
dbr
:Context-free_grammar
dbr
:Sublinear_function
dbr
:Metcalfe's_law
dbr
:Pseudo-polynomial_time
dbr
:Permutation
dbr
:Complexity_class
dbr
:Graph_minor
dbr
:Lindelöf_hypothesis
dbr
:Memoization
dbr
:Multiple_sequence_alignment
dbr
:Prime_gap
is
dbp:
averageTime
of
dbr
:Linear_search
dbr
:Interpolation_search
dbr
:Binary_search
dbr
:Exponential_search
dbr
:Multiplicative_binary_search
is
dbp:
bestTime
of
dbr
:Linear_search
dbr
:Interpolation_search
dbr
:Binary_search
dbr
:Exponential_search
dbr
:Multiplicative_binary_search
is
dbp:
decreaseKeyWorst
of
dbr
:Strict_Fibonacci_heap
is
dbp:
deleteMinWorst
of
dbr
:Strict_Fibonacci_heap
is
dbp:
findMinWorst
of
dbr
:Strict_Fibonacci_heap
is
dbp:
insertWorst
of
dbr
:Strict_Fibonacci_heap
is
dbp:
knownFor
of
dbr
:G._H._Hardy
is
dbp:
mergeWorst
of
dbr
:Strict_Fibonacci_heap
is
dbp:
space
of
dbr
:Interpolation_search
dbr
:Binary_search
dbr
:Exponential_search
dbr
:Multiplicative_binary_search
is
dbp:
spaceWorst
of
dbr
:Strict_Fibonacci_heap
is
dbp:
time
of
dbr
:Linear_search
dbr
:Interpolation_search
dbr
:Binary_search
dbr
:Exponential_search
dbr
:Multiplicative_binary_search
is
rdfs:
seeAlso
of
dbr
:Associative_containers_(C++)
is
foaf:
primaryTopic
of
wikipedia-en
:Big_O_notation
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International