Bookbot

The Tomes of Delphi - Algorithms and Data Structures

Ocena książki

Parametry

  • 525 stron
  • 19 godzin czytania

Więcej o książce

Delphi developer Julian Bucknall provides fellow developers a comprehensive overview of using algorithms and data structures from a practical perspective. Bucknall begins with a discussion of algorithm performance, and provides comprehensive coverage of such topics as arrays, linked lists, and binary trees. The book focuses on search algorithms—such as sequential and binary search—and sort algorithms—including bubble, insertion, Shell sort, quicksort, merge sort, and heapsort—along with techniques for optimization. Additionally, the author presents hashing and hash tables, priority queues, state machines and regular expressions, and data compression techniques such as Huffman and LZ77.

Zakup książki

The Tomes of Delphi - Algorithms and Data Structures, Julian Bucknall

Język
Rok wydania
2001
Oprawa
(miękka)
Jak tylko się pojawi, wyślemy Ci wiadomość e-mail.

Metody płatności

3,5
Dobra
10 Ocena

Brakuje nam tutaj Twojej recenzji.

Tytuł
The Tomes of Delphi - Algorithms and Data Structures
Język
angielski
Rok wydania
2001
Oprawa
miękka
Liczba stron
525
ISBN10
1556227361
ISBN13
9781556227363
Seria
Tagi
Ocena
3,5 z 5
Opis
Delphi developer Julian Bucknall provides fellow developers a comprehensive overview of using algorithms and data structures from a practical perspective. Bucknall begins with a discussion of algorithm performance, and provides comprehensive coverage of such topics as arrays, linked lists, and binary trees. The book focuses on search algorithms—such as sequential and binary search—and sort algorithms—including bubble, insertion, Shell sort, quicksort, merge sort, and heapsort—along with techniques for optimization. Additionally, the author presents hashing and hash tables, priority queues, state machines and regular expressions, and data compression techniques such as Huffman and LZ77.