Ternary Search : Computer Science, Ternary, Maxima and Minima, Function (Mathematics), Divide and Conquer Algorithm, Search Algorithm

Lambert M. Surhone

ISBN 10: 6131123888 / ISBN 13: 9786131123887

Published by Omniscriptum, 2010

About this Item

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

Bibliographic Details

• Title: Ternary Search : Computer Science, Ternary, Maxima and Minima, Function (Mathematics), Divide and Conquer Algorithm, Search Algorithm
• Publisher: Omniscriptum
• Publication Date: 2010
• Language: English
• ISBN 10: 6131123888
• ISBN 13: 9786131123887
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 220W x 150H x 6D millimeters 220 millimeters width by 150 millimeters height by 6 millimeters depth
• Weight: 143 grams

About this title

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).