Author : Kyle Loudon
Publisher : "O'Reilly Media, Inc."
Page : 560 pages
File Size : 43,45 MB
Release : 1999
Category : Computers
ISBN : 1565924533
Implementations, as well as interesting, real-world examples of each data structure and algorithm, are shown in the text. Full source code appears on the accompanying disk.
Author : Robert Sedgewick
Publisher : Addison-Wesley Professional
Page : 0 pages
File Size : 37,71 MB
Release : 1990
Category : Algorithms
ISBN : 9780768682335
Algorithms in C is a comprehensive repository of algorithms, complete with code. If you're in a pinch and need to code something up fast, this book is the place to look. Starting with basic data structures, Algorithms in C covers an enormous scope of information, with extensive treatment of searching and advanced data structures, sorting, string processing, computational geometry, graph problems, and mathematical algorithms. Although the manual often neglects to provide rigorous analysis, the text surrounding the algorithms provides clear and relevant insight into why the algorithms work.
Author : Luciano Manelli
Publisher :
Page : 146 pages
File Size : 15,19 MB
Release : 2020
Category : Algorithms
ISBN :
Study elementary and complex algorithms with clear examples and implementations in C. This book introduces data types (simple and structured) and algorithms with graphical and textual explanations. In the next sections, you’ll cover simple and complex standard algorithms with their flowcharts: everything is integrated with explanations and tables to give a step-by-step evolution of the algorithms. The main algorithms are: the sum of three or n numbers in a loop, decimal-to-binary conversion, maximum and minimum search, linear/sequential search, binary search, bubble sort, selection sort, merging of two sorted arrays, reading characters from a file, stack management, and factorial and Fibonacci sequences. The last section of Introducing Algorithms in C is devoted to the introduction of the C language and the implementation of the code, which is connected to the studied algorithms. The book is full of screenshots and illustrations showing the meaning of the code. You will: Implement algorithms in C Work with variables, constants, and primitive and structured types Use arrays, stacks, queues, graphs, trees, hash tables, records, and files Explore the design of algorithms Solve searching problems, including binary search, sorting, and bubble/selection sort Program recursive algorithms with factorial functions and Fibonacci sequences.
Author : Thomas A. Standish
Publisher : Pearson
Page : 778 pages
File Size : 25,17 MB
Release : 1995
Category : Computers
ISBN :
Using C, this book develops the concepts and theory of data structures and algorithm analysis in a gradual, step-by-step manner, proceeding from concrete examples to abstract principles. Standish covers a wide range of both traditional and contemporary software engineering topics. The text also includes an introduction to object-oriented programming using C++. By introducing recurring themes such as levels of abstraction, recursion, efficiency, representation and trade-offs, the author unifies the material throughout. Mathematical foundations can be incorporated at a variety of depths, allowing the appropriate amount of math for each user.
Author : Paul M. Embree
Publisher : Prentice Hall
Page : 272 pages
File Size : 36,30 MB
Release : 1995
Category : Computers
ISBN :
Digital signal processing techniques have become the method of choice in signal processing as digital computers have increased in speed, convenience, and availability. At the same time, the C language is proving itself to be a valuable programming tool for real-time computationally intensive software tasks. This book is a complete guide to digital signal processing techniques in the C language. Covers the basic principles of digital signal processing and C programming. Introduces the basic real-time DSP programming techniques and typical programming environments which are used with DSP microprocessors. Covers the basic real-time filtering techniques which are the cornerstone of one-dimensional real-time digital signal processing. For electrical engineers and computer scientists. The CD contents are on the book's main web page -- www.informit.com/title/0133373533
Author : Thomas H. Cormen
Publisher : MIT Press
Page : 1313 pages
File Size : 46,51 MB
Release : 2009-07-31
Category : Computers
ISBN : 0262258102
The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called “Divide-and-Conquer”), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.
Author : Giesela Engeln-Müllges
Publisher : Springer Science & Business Media
Page : 610 pages
File Size : 21,15 MB
Release : 2013-11-21
Category : Mathematics
ISBN : 3642610749
More scientists now use C than any other programming language. This book contains practical, computer-ready algorithms for many standard methods of numerical mathematics. It describes the principles of the various methods and provides support in choosing the appropriate method for a given task. Topics given special emphasis include converging methods for solving nonlinear equations, methods for solving systems of linear equations for many special matrix structures, and the Shepard method for multidimensional interpolation. The CD contains C-programs for almost all the algorithms given in the book and a compiler, together with software for graphical printing.
Author : Thomas Mailund
Publisher : Apress
Page : pages
File Size : 26,67 MB
Release : 2020-11-12
Category : Computers
ISBN : 9781484259191
Implement practical data structures and algorithms for text search and discover how it is used inside other larger applications. This unique in-depth guide explains string algorithms using the C programming language. String Algorithms in C teaches you the following algorithms and how to use them: classical exact search algorithms; tries and compact tries; suffix trees and arrays; approximative pattern searches; and more. In this book, author Thomas Mailund provides a library with all the algorithms and applicable source code that you can use in your own programs. There are implementations of all the algorithms presented in this book so there are plenty of examples. You’ll understand that string algorithms are used in various applications such as image processing, computer vision, text analytics processing from data science to web applications, information retrieval from databases, network security, and much more. What You Will Learn Use classical exact search algorithms including naive search, borders/border search, Knuth-Morris-Pratt, and Boyer-Moor with or without Horspool Search in trees, use tries and compact tries, and work with the Aho-Carasick algorithm Process suffix trees including the use and development of McCreight’s algorithm Work with suffix arrays including binary searches; sorting naive constructions; suffix tree construction; skew algorithms; and the Borrows-Wheeler transform (BWT) Deal with enhanced suffix arrays including longest common prefix (LCP) Carry out approximative pattern searches among suffix trees and approximative BWT searches Who This Book Is For Those with at least some prior programming experience with C or Assembly and have at least prior experience with programming algorithms.
Author : Robert Sedgewick
Publisher : Addison Wesley Publishing Company
Page : 680 pages
File Size : 18,55 MB
Release : 1988
Category : Computers
ISBN :
Software -- Programming Techniques.
Author : Bryan Flamig
Publisher : Wiley
Page : 0 pages
File Size : 32,75 MB
Release : 1995-03-02
Category : Computers
ISBN : 9780471009559
A practical guide to implementing algorithms in C++. Have you been looking for a C++ book that not only talks about some of the most popular algorithms of today, but also implements them? Then look no further. This book presents algorithms from a practical point of view, clearly explaining how the algorithms work, as well as fully implementing them in C++. Written to the intermediate C++ programmer, this book covers a wide range of subjects, from sorting and searching algorithms, to graph traversal algorithms, hashing algorithms, priority queues, finite state machines, and "algorithmic generators," a unique, object-oriented way of implementing algorithms. Includes theory and practice, with emphasis on practice. Builds from the basics to the most advanced techniques. Backs each algorithm with full source code provided on disk-no misleading code fragments. Includes high quality code, written specifically for C++, and not simply ported from some other language. All code fully tested in Borland and Microsoft versions of C++.
