Data Structures and Algorithm Analysis in C; Thomas G. Weiss; 2003

Data Structures and Algorithm Analysis in C Upplaga 2

av Thomas G. Weiss
In this second edition of his best-selling book, Data Structures and Algorithm Analysis in C, Mark Allen Weiss, continues to refine and enhance his innovative approach to algorithms and data structures. Using a C implementation, he highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. Dr. Weiss also distinguishes Data Structures and Algorithm Analysis in C with the extensive use of figures and examples showing the successive stages of an algorithm, his engaging writing style, and a logical organization of topics.

Features Includes a chapter on algorithm and design techniques that covers greedy algorithms, divide and conquer algorithms, dynamic programming, randomized algorithms, and backtracking

Presents current topics and newer data structures such as Fibonacci heaps, skew heaps, binomial queues, skip lists, and splay trees

Contains a chapter on amortized analysis that examines the advanced data structures presented earlier in the book

Provides a new chapter on advanced data structures and their implementation covering red black trees, top down splay trees, treaps, k-d trees, pairing heaps, and more

Incorporates new results on the average case analysis of heapsort

Offers source code from example programs via anonymous FTP

0201498405B04062001
In this second edition of his best-selling book, Data Structures and Algorithm Analysis in C, Mark Allen Weiss, continues to refine and enhance his innovative approach to algorithms and data structures. Using a C implementation, he highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. Dr. Weiss also distinguishes Data Structures and Algorithm Analysis in C with the extensive use of figures and examples showing the successive stages of an algorithm, his engaging writing style, and a logical organization of topics.

Features Includes a chapter on algorithm and design techniques that covers greedy algorithms, divide and conquer algorithms, dynamic programming, randomized algorithms, and backtracking

Presents current topics and newer data structures such as Fibonacci heaps, skew heaps, binomial queues, skip lists, and splay trees

Contains a chapter on amortized analysis that examines the advanced data structures presented earlier in the book

Provides a new chapter on advanced data structures and their implementation covering red black trees, top down splay trees, treaps, k-d trees, pairing heaps, and more

Incorporates new results on the average case analysis of heapsort

Offers source code from example programs via anonymous FTP

0201498405B04062001
Upplaga: 2a upplagan
Utgiven: 2003
ISBN: 9780321189950
Förlag: Pearson
Format: Häftad
Språk: Engelska
Sidor: 600 st
In this second edition of his best-selling book, Data Structures and Algorithm Analysis in C, Mark Allen Weiss, continues to refine and enhance his innovative approach to algorithms and data structures. Using a C implementation, he highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. Dr. Weiss also distinguishes Data Structures and Algorithm Analysis in C with the extensive use of figures and examples showing the successive stages of an algorithm, his engaging writing style, and a logical organization of topics.

Features Includes a chapter on algorithm and design techniques that covers greedy algorithms, divide and conquer algorithms, dynamic programming, randomized algorithms, and backtracking

Presents current topics and newer data structures such as Fibonacci heaps, skew heaps, binomial queues, skip lists, and splay trees

Contains a chapter on amortized analysis that examines the advanced data structures presented earlier in the book

Provides a new chapter on advanced data structures and their implementation covering red black trees, top down splay trees, treaps, k-d trees, pairing heaps, and more

Incorporates new results on the average case analysis of heapsort

Offers source code from example programs via anonymous FTP

0201498405B04062001
In this second edition of his best-selling book, Data Structures and Algorithm Analysis in C, Mark Allen Weiss, continues to refine and enhance his innovative approach to algorithms and data structures. Using a C implementation, he highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. Dr. Weiss also distinguishes Data Structures and Algorithm Analysis in C with the extensive use of figures and examples showing the successive stages of an algorithm, his engaging writing style, and a logical organization of topics.

Features Includes a chapter on algorithm and design techniques that covers greedy algorithms, divide and conquer algorithms, dynamic programming, randomized algorithms, and backtracking

Presents current topics and newer data structures such as Fibonacci heaps, skew heaps, binomial queues, skip lists, and splay trees

Contains a chapter on amortized analysis that examines the advanced data structures presented earlier in the book

Provides a new chapter on advanced data structures and their implementation covering red black trees, top down splay trees, treaps, k-d trees, pairing heaps, and more

Incorporates new results on the average case analysis of heapsort

Offers source code from example programs via anonymous FTP

0201498405B04062001
Begagnad bok (0 st)

Om Data Structures and Algorithm Analysis in C (2003)

I juni 2003 släpptes boken Data Structures and Algorithm Analysis in C skriven av Thomas G. Weiss. Det är den 2a upplagan av kursboken. Den är skriven på engelska och består av 600 sidor djupgående information om övrigt. Förlaget bakom boken är Pearson som har sitt säte i London.

Köp boken Data Structures and Algorithm Analysis in C direkt från en annan student på Studentapan och spara pengar.

KurslitteraturÖvrigtÖvrigtData Structures and Algorithm Analysis in C
Bokens omdömen
Ingen har recenserat den här boken ännu.

Sälj vidare boken när du är klar

När du är klar med boken säljer du enkelt vidare och tjänar pengar på nolltid med Studentapan. Vi tar hand om allt det krångliga så att du får mer tid över till annat. På det sättet kan du tjäna tillbaka det mesta av kostnaden för boken.
Värdera & sälj böcker

Klimatsmart kurslitteratur

Bli en miljöhjälte under din studietid och ge dina gamla kursböcker ett nytt liv. Genom att återanvända dina kursböcker minskar du utsläppen av koldioxid (CO2) med hela 59%. För en psykologstudent skulle det innebära minskade CO2-utsläpp med cirka 240 kg under studietiden. En stor vinst för din plånbok och miljön. Det kallar vi klimatsmart kurslitteratur.

Liknande kurslitteratur

Begagnad bok (0 st)