Cantitate/Preț
Produs
Total produse
Vezi coșul
Sorting de Hosam M Mahmoud

Sorting: Wiley Series in Discrete Mathematics and Optimization

Autor Hosam M Mahmoud
en Limba Engleză Hardback – 14 aug 2000
In diesem Buch wurden Informationen zusammengetragen, die bislang nur Spezialisten zugänglich waren. Dem Autor ist es gelungen, aktuellste Forschungsergebnisse auf dem Gebiet des Sortierens so auszuwählen und aufzubereiten, daß auch Studenten und fachfremde Interessenten profitieren können. Nach einleitenden Bemerkungen werden sämtliche Standard-Sortieralgorithmen - klassische und moderne Ansätze - vorgestellt sowie in Worten und an Codebeispielen erläutert. (09/00)
Citește tot Restrânge

Din seria Wiley Series in Discrete Mathematics and Optimization

  • 9% Integer and Combinatorial Optimization
    Preț: 110609 lei
  • 23% Integer Programming
    Preț: 76106 lei
  • 9% Optimization Methods for Logical Inference
    Preț: 108920 lei
  • 23% Cryptography, Information Theory, and Error–Correction: A Handbook for the 21st Century
    Preț: 105003 lei
  • 9% Random Graphs
    Preț: 103736 lei
  • 9% Introduction to the Theory of Error–Correcting Codes 3e
    Preț: 113456 lei
  • 9% Interior Point Algorithms – Theory and Analysis
    Preț: 132978 lei
  • 9% Average Case Analysis of Algorithms on Sequences
    Preț: 126190 lei
  • 9% Network Models in Optimization and their Applications in Practice
    Preț: 141610 lei
  • 8% Ramsey Theory, Second Edition
    Preț: 52113 lei

Preț: 106843 lei

Preț vechi: 162240 lei
-34%

Puncte Express: 1603
Preț estimativ în valută:
18909€ • 22099$ • 16417£

Carte indisponibilă temporar


Wish list
Gift list
Am citit!
Adaugă în listă
Doresc să fiu notificat când acest titlu va fi disponibil:
Trimite
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780471327103
ISBN-10: 0471327107
Pagini: 416
Dimensiuni: 162 x 242 x 24 mm
Greutate: 0.7 kg
Editura: Wiley
Seria Wiley Series in Discrete Mathematics and Optimization

Locul publicării:Hoboken, United States

Public țintă

Computer Professionals, Mathematicians and Engineers, Beginning Graduate Students, end of master′s program.

Descriere

This work covers the emerging distributional theory of sorting. It book opens with a chapter on the general area of complete and partial sorting. The following chapters discuss every standard sorting algorithm with a careful explanation of the mechanics of the algorithm both as code and verbally.