Ternary Search: Computer Science, Ternary, Maxima and Minima, Function (Mathematics), Divide and Conquer Algorithm, Search Algorithm - Tapa blanda
Sinopsis
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. A ternary search algorithm is a technique in computer science for finding the minimum or maximum of a function that is either strictly increasing and then strictly decreasing or vice versa. A ternary search determines either that the minimum or maximum cannot be in the first third of the domain or that it cannot be in the last third of the domain, then repeats on the remaining two-thirds. A ternary search is an example of a divide and conquer algorithm (see search algorithm).
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. A ternary search algorithm is a technique in computer science for finding the minimum or maximum of a function that is either strictly increasing and then strictly decreasing or vice versa. A ternary search determines either that the minimum or maximum cannot be in the first third of the domain or that it cannot be in the last third of the domain, then repeats on the remaining two-thirds. A ternary search is an example of a divide and conquer algorithm (see search algorithm).
"Sobre este título" puede pertenecer a otra edición de este libro.
Resultados de la búsqueda para Ternary Search: Computer Science, Ternary, Maxima and...
Imagen del vendedor
Ternary Search
Publicado por
Omniscriptum Mär 2026, 2026
ISBN 10: 6131123888
ISBN 13: 9786131123887
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! A ternary search algorithm is a technique in computer science for finding the minimum or maximum of a function that is either strictly increasing and then strictly decreasing or vice versa. A ternary search determines either that the minimum or maximum cannot be in the first third of the domain or that it cannot be in the last third of the domain, then repeats on the remaining two-thirds. A ternary search is an example of a divide and conquer algorithm (see search algorithm). 84 pp. Englisch. Nº de ref. del artículo: 9786131123887
Comprar nuevo
EUR 34,00
Envío por EUR 23,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Ternary Search : Computer Science, Ternary, Maxima and Minima, Function (Mathematics), Divide and Conquer Algorithm, Search Algorithm
Impresión bajo demandaLibrería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! A ternary search algorithm is a technique in computer science for finding the minimum or maximum of a function that is either strictly increasing and then strictly decreasing or vice versa. A ternary search determines either that the minimum or maximum cannot be in the first third of the domain or that it cannot be in the last third of the domain, then repeats on the remaining two-thirds. A ternary search is an example of a divide and conquer algorithm (see search algorithm). Nº de ref. del artículo: 9786131123887
Comprar nuevo
EUR 35,89
Envío por EUR 60,72
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Ternary Search | Computer Science, Ternary, Maxima and Minima, Function (Mathematics), Divide and Conquer Algorithm, Search Algorithm
Impresión bajo demandaLibrería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Ternary Search | Computer Science, Ternary, Maxima and Minima, Function (Mathematics), Divide and Conquer Algorithm, Search Algorithm | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131123887 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 113275245
Comprar nuevo
EUR 109,85
Envío por EUR 70,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen del vendedor
Ternary Search
Publicado por
Omniscriptum Mär 2026, 2026
ISBN 10: 6131123888
ISBN 13: 9786131123887
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. A ternary searchalgorithm is a technique in computer science for finding the minimum ormaximum of a function that is either strictly increasing and thenstrictly decreasing or vice versa. A ternary search determines eitherthat the minimum or maximum cannot be in the first third of the domainor that it cannot be in the last third of the domain, then repeats onthe remaining two-thirds. A ternary search is an example of a divide andconquer algorithm (see search algorithm).VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 84 pp. Englisch. Nº de ref. del artículo: 9786131123887
Comprar nuevo
EUR 136,00
Envío por EUR 60,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles