Lably
Skip to content

Edward M. McCreight

  • 1 min read
  • 1 chapters

Related on Lably

Through Americans

Lab · Class 5–9History Explorer

More in Theoretical computer science

Time complexityEstimate of time taken for running an algorithmBig O notationDescribes approximate behavior of a functionArray (data structure)Type of data structureFinite-state machineMathematical model of computationTree (abstract data type)Linked node hierarchical data structureNP-hardnessComplexity class