palme kitabevi, akademik kitap, hazırlık kitapları, eğitim yayınları, üniversite kitapları, sınav hazırlık, ders kitapları, akademik kaynak
 
Kapat
0 Ürün
Alışveriş sepetinizde boş.
Kategoriler
    Filtreler
    Preferences
    Ara

    Data Structures 4e

    Yayınevi : Pearson Education
    Yazar : Mark A. Weiss
    ISBN :9780132847377
    Sayfa Sayısı :656
    Baskı Sayısı :4
    Ebatlar :18.00 x 23.00
    Basım Yılı :2013
    10074,00 ₺

    Bu ürün için iade seçeneği bulunmamaktadır.

    Tahmini Kargoya Veriliş Zamanı: 2-4 iş günü içerisinde tedarik edilip kargoya verilecektir.

    Data Structures and Algorithm Analysis in C++ is an advanced algorithms book that bridges the gap between traditional CS2 and Algorithms Analysis courses. As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs using the C++ programming language. This book explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss’ careful, rigorous and in-depth analysis of each type of algorithm.

    Data Structures and Algorithm Analysis in C++ is an advanced algorithms book that bridges the gap between traditional CS2 and Algorithms Analysis courses. As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs using the C++ programming language. This book explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss’ careful, rigorous and in-depth analysis of each type of algorithm.

    >