Okuzeka
Software Engineering vocabulary · Data Structures and Algorithms

Time complexity

Meaning in software engineering, with examples

/ˈtaɪm kəmˌpleksəti/nounAdvanced term

In software engineering, time complexity means: How the number of steps an algorithm takes grows as the size of its input grows, usually written in Big O notation.

In Turkish: zaman karmaşıklığı

How it is used

Interviewers ask 'What's the time complexity of your solution?' It is often discussed together with 'space complexity', which is about memory. You analyze, compare and reduce time complexity.

Example sentences

  1. Sorting the list first brings the time complexity down from O(n²) to O(n log n).

  2. The code works, but its time complexity is too high for a million records.

Common collocations

  • time complexity of
  • space complexity
  • reduce the time complexity
  • linear time complexity
  • Big O notationA way of describing how the running time or memory use of an algorithm grows as the input gets bigger, for example O(1), O(n) or O(n²).
  • algorithmA clear, step-by-step method for solving a problem or doing a task, such as sorting a list or finding the shortest route between two points.
  • data structureA way of organizing data in memory, such as an array, list, tree or hash map, so that certain operations are fast and simple.
  • scalableAble to handle more users, data or traffic by adding resources, without a complete redesign and without becoming much slower.

More terms: Data Structures and Algorithms

Practise with graded reading

Reading at the right level is the fastest way to make new words stick. Pick free English books by level: