Brezplačna dostava za naročila nad 69,99 € na prevzemna mesta DPD in Express One.

Preverjanje stanja naročila

Postanite del skupnosti ljubiteljev knjig z vsega sveta in uživajte v številnih ugodnostih. Ustvarite brezplačen račun

Brezplačna dostava Zásilkovna nad 69.99 €

Zbirna točka GLS 4.49 € Zbirna točka DPD 2.99 € Kurirska služba GLS 5.49 € Kurir DPD 3.49 € Kurirska služba Express One 3.49 € Zbirno mesto Express One 3.49 € Zbirno mesto Pošte Slovenije 3.49 € Dostava preko Pošte Slovenije 3.49 €

Kontakt

Kako nakupovati

Pomoč

Moj račun

▸ Prazna :-(

Brezplačna dostava za naročila nad 69,99 € na prevzemna mesta DPD in Express One.

Computer Algorithms, Introduction to Design and Analysis

Name: Computer Algorithms, Introduction to Design and Analysis
Brand: LAP LAMBERT Academic Publishing
SKU: 32790842
Price: 51.87 EUR
Availability: InStock
Author: Shraddha N. Zanjat
ISBN: 9786202528849

Shraddha N. Zanjat

Bhavana S. Karmore

Jezik

Angleščina

Knjiga Mehka

Koda Libristo: 32790842

Založba LAP LAMBERT Academic Publishing, april 2020

The aim of this book is to understand: Algorithm, Pseudo code for expressing algorithms, Performance... Celoten opis

Koda Libristo: 32790842

126 b

51.87 €

Na zalogi pri dobavitelju Odposlali bomo v 5-8 dneh

Do 30 dni za vračilo

Drugi so kupili tudi

Auswirkungen Des Marshallplans Auf Den Westlichen Teil Deutschlands Torben Wengenroth

Mehka

13.51 €

Dr. Joseph Salzmanns Leben Und Wirken Joseph Rainer

Mehka

39.25 €

Pinatas and Paper Flowers: Holidays of the Americas in English and Spanish Lila Perl

Mehka

7.16 €

Final Fantasy - Official Memorial Ultimania : X bis XIV - Official Memorial Ultimania Book Lasse Christian Christiansen

Trda

31.48 €

SPA-CUENTOS COMPLETOS Jorge Asis

Mehka

18.86 €

The aim of this book is to understand: Algorithm, Pseudo code for expressing algorithms, Performance Analysis-Space complexity, Time complexity, Asymptotic Notation - Big oh notation, Omega notation, The ta notation and Little oh notation, Probabilistic analysis, Amortized analysis. Searching and Traversal Techniques: Efficient non - recursive binary tree traversal algorithm, Disjoint set operations, union and find algorithms, Spanning trees.