Hashing
The number of accesses to search for a stored object is of order O(log2(n)) when using sorted arrays or binary search trees. With hashing, we ideally find a stored object with one single access. We achieve this by calculating the address of the object.
- PDF / 4,637,144 Bytes
- 356 Pages / 439.42 x 666.14 pts Page_size
- 10 Downloads / 197 Views
Algorithms and Data Structures
Foundations and Probabilistic Methods for Design and Analysis
Algorithms and Data Structures
Helmut Knebl
Algorithms and Data Structures Foundations and Probabilistic Methods for Design and Analysis
Helmut Knebl Fakultät Informatik Technische Hochschule Nürnberg Nürnberg, Germany
Ursprünglich veröffentlicht in deutscher Sprache: Algorithmen und Datenstrukturen von Prof. Dr. Helmut Knebl Copyright © Springer Fachmedien Wiesbaden GmbH, ein Teil von Springer Nature 2019. Alle Rechte vorbehalten. ISBN 978-3-030-59757-3 ISBN 978-3-030-59758-0 (eBook) https://doi.org/10.1007/978-3-030-59758-0 © Springer Nature Switzerland AG 2020 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors, and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. This Springer imprint is published by the registered company Springer Nature Switzerland AG The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
Preface
Many practical problems can be solved by algorithms. For this reason, computer algorithms are diverse and ubiquitous today. The spectrum ranges from one of the oldest recorded algorithms, the algorithm of Euclid from the third century B.C., to algorithms for the investigation of large amounts of data, algorithms for communication and searching on the Internet, algorithms for imaging procedures and for diagnostics in medical technology, and algorithms for assistance systems in cars, engine control or the control of household appliances. Algorithms are the subject of intensive research and belong to the fundamental concepts of computer science. The design of efficient algorithms and their analysis with regard to resource requirements are fundamental for the development of computer programs. Therefore, the subject Algorithms and Data Structures is a central component of any computer science curriculum. This book originates from lectures on algorithms and data structures for studen
Data Loading...
