linear-time access algorithm
[/ˈlɪn.i.ər taɪm ˈæk.ses ˈæl.ɡə.rɪ.ðəm/]
nounpl: linear-time access algorithms
algoritmo de acesso em tempo linear
1. A computational algorithm that accesses data elements in a sequence proportional to the size of the input, with time complexity of O(n), where n is the number of elements
A simple linear search through an unsorted array is a linear-time access algorithm because it must potentially examine every element.
Uma busca linear simples em um array desordenado é um algoritmo de acesso em tempo linear porque deve potencialmente examinar cada elemento.
2. An algorithm whose execution time grows linearly with the increase in input size, meaning if input doubles, execution time approximately doubles
Iterating through a linked list to find an element represents a linear-time access algorithm in the worst case.
Iterar através de uma lista ligada para encontrar um elemento representa um algoritmo de acesso em tempo linear no pior caso.
This is technical terminology used universally in computer science, software engineering, and mathematics communities across Brazil, USA, and Portugal. It's primarily found in academic settings, technical documentation, and professional programming discussions. The concept is fundamental to understanding algorithm efficiency and is taught in computer science curricula worldwide.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →