Ternary Search: Computer Science, Ternary, Maxima and Minima, Function (Mathematics), Divide and Conquer Algorithm, Search Algorithm - Softcover
Synopsis
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).
"synopsis" may belong to another edition of this title.
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).
"About this title" may belong to another edition of this title.
Search results for Ternary Search: Computer Science, Ternary, Maxima and...
Seller Image
Ternary Search
Print on DemandSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9786131123887
Buy New
US$ 39.86
US$ 26.18 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available
Seller Image
Ternary Search : Computer Science, Ternary, Maxima and Minima, Function (Mathematics), Divide and Conquer Algorithm, Search Algorithm
Print on DemandSeller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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). Seller Inventory # 9786131123887
Buy New
US$ 42.08
US$ 69.12 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available
Seller Image
Ternary Search | Computer Science, Ternary, Maxima and Minima, Function (Mathematics), Divide and Conquer Algorithm, Search Algorithm
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 113275245
Buy New
US$ 128.80
US$ 79.68 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 5 available
Seller Image
Ternary Search
Print on DemandSeller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9786131123887
Buy New
US$ 159.46
US$ 68.30 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available