Portada del libro de Linear Search
Título del libro:

Linear Search

Computer science, Search algorithm, Average-case complexity

Fidel (2011-08-13 )

Books loader

Omni badge apto para el cupón
ISBN-13:

978-613-6-59470-5

ISBN-10:
6136594706
EAN:
9786136594705
Idioma del libro:
Inglés
Notas y citas / Texto breve:
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, linear search or sequential search is a method for finding a particular value in a list, that consists of checking every one of its elements, one at a time and in sequence, until the desired one is found. Linear search is the simplest search algorithm; it is a special case of brute-force search. Its worst case cost is proportional to the number of elements in the list; and so is its expected cost, if all list elements are equally likely to be searched for. Therefore, if the list has more than a few elements, other methods will be faster, but they also impose additional requirements. For a list with n items, the best case is when the value is equal to the first element of the list, in which case only one comparison is needed. The worst case is when the value is not in the list, in which case n comparisons are needed.
Editorial:
Fidel
Sitio web:
http://www.alphascript-publishing.com
Editado por:
Christabel Donatienne Ruby
Número de páginas:
76
Publicado en:
2011-08-13
Stock:
Disponible
Categoría:
Informática, IT
Precio:
34.00 €
Palabras clave:
Computer, Science, Algorithm, Sequence, linear, computer, Algorithmen

Books loader

Adyen::diners Adyen::jcb Adyen::discover Adyen::amex Adyen::mc Adyen::visa Adyen::cup Adyen::ach Adyen::wechatpay Adyen::unionpay PayPal Transferencia Bancaria

  0 productos en el carrito
Editar carrito
Loading frontend
LOADING