image top
Giỏ hàng Giỏ hàng 0
Không có sản phẩm trong giỏ hàng.
Email cho bạn bè

Mastering Algorithms with C

268,000₫
  • ✪ Miễn phí GIAO HÀNG đơn hàng từ 399.000đ
  • ✪ Giao hàng COD toàn quốc nhanh chóng từ 2 - 4 ngày
  • ✪ Giao hàng HOẢ TỐC trong nội thành Hà Nội
  • ✪ Hỗ trợ xuất hóa đơn VAT theo yêu cầu

Mastering Algorithms with C

Sách gia công, Bìa mềm
 
 
There are many books on data structures and
algorithms, and some books containing code for C libraries, but this
book gives you a unique combination of theoretical background and
working code. In offering robust solutions for everyday programming
tasks, Mastering Algorithms with C avoids the abstract style of
most classic data structures and algorithms texts but still provides all
the information you need to understand the purpose and use of common
programming techniques.
 
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.
 
Using
an exceptionally clean programming style and writing style, Kyle Loudon
shows you how to use such essential data structures as lists, stacks,
queues, sets, trees, heaps, priority queues, and graphs. He shows you
how to use algorithms for sorting, searching, numerical analysis, data
compression, data encryption, common graph problems, and computational
geometry. He also describes the relative efficiency of all
implementations. The compression and encryption chapters not only give
you working code for reasonably efficient solutions, they explain
concepts in an approachable manner for people who never have had the
time or expertise to study them in depth.
 
Anyone with a basic
understanding of the C language can use this book. In order to provide
maintainable and extendable code, an extra level of abstraction (such as
pointers to functions) is used in examples where appropriate.
Understanding that these techniques may be unfamiliar to some
programmers, Loudon explains them clearly in the introductory chapters.
 
Contents include:
 
• Pointers
 
• Recursion
 
• Analysis of algorithms
 
• Data structures (lists, stacks, queues, sets, hash tables, trees, heaps, priority queues, and graphs)
 
• Sorting and searching
 
• Numerical methods
 
• Data compression
 
• Data encryption
 
• Graph algorithms
 
• Geometric algorithms
 
 
Thể loại:Computers - Programming
 
Năm:1999
 
Nhà xuát bản:O'Reilly Media
 
Ngôn ngữ:english
 
Trang:540