Perfeziona la tua ricerca

  • Libri (7)

a

Fascia di prezzo personalizzata (EUR)

a

L kyle loudon (7 risultati)

Autore: 
Perfeziona con la Ricerca avanzata
  • Lingua: Inglese

    Editore: O'Reilly Media, 1999

    1565924533 / 9781565924536

    • Brossura

    Da: World of Books (was SecondSale), Montgomery, IL, U.S.A.World of Books (was SecondSale)

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Usato - Buono

    EUR 6,30

     Spedizione gratuita 
    Spedito in U.S.A.

    Quantità: 3 disponibili

    Condizione: Good. Offering solutions for everyday programming tasks, this text provides information on the purpose and use of common programming techniques. Implementations and real-world examples of each data structure are shown in the text.

  • Lingua: Inglese

    Editore: O'Reilly Media, US, 1999

    1565924533 / 9781565924536

    • Brossura

    Da: Rarewaves USA, HEBRON, KY, U.S.A.Rarewaves USA

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 46,94

     Spedizione gratuita 
    Spedito in U.S.A.

    Quantità: Più di 20 disponibili

    Paperback. Condizione: New. There are many books on data structures and algorithms, including some with useful libraries of C functions. Mastering Algorithms with C offers you a unique combination of theoretical background and working code. With robust solutions for everyday programming tasks, this book avoids the abstract style of most classic data structures and algorithms texts, but still provides all of 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 included. Using both a programming style and a writing style that are exceptionally clean, Kyle Loudon shows you how to use such essential data structures as lists, stacks, queues, sets, trees, heaps, priority queues, and graphs. He explains how to use algorithms for sorting, searching, numerical analysis, data compression, data encryption, common graph problems, and computational geometry. And he describes the relative efficiency of all implementations.The compression and encryption chapters not only give you working code for reasonably efficient solutions, they offer explanations of 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 extendible 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, graphs) * Sorting and searching * Numerical methods * Data compression * Data encryption * Graph algorithms * Geometric algorithms.…

  • Lingua: Inglese

    Editore: O'Reilly Media, US, 1999

    1565924533 / 9781565924536

    • Brossura

    Da: Rarewaves.com USA, London, LONDO, Regno UnitoRarewaves.com USA

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 64,68

     Spedizione gratuita 
    Spedito da Regno Unito a U.S.A.

    Quantità: 1 disponibile

    Paperback. Condizione: New. There are many books on data structures and algorithms, including some with useful libraries of C functions. Mastering Algorithms with C offers you a unique combination of theoretical background and working code. With robust solutions for everyday programming tasks, this book avoids the abstract style of most classic data structures and algorithms texts, but still provides all of 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 included. Using both a programming style and a writing style that are exceptionally clean, Kyle Loudon shows you how to use such essential data structures as lists, stacks, queues, sets, trees, heaps, priority queues, and graphs. He explains how to use algorithms for sorting, searching, numerical analysis, data compression, data encryption, common graph problems, and computational geometry. And he describes the relative efficiency of all implementations.The compression and encryption chapters not only give you working code for reasonably efficient solutions, they offer explanations of 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 extendible 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, graphs) * Sorting and searching * Numerical methods * Data compression * Data encryption * Graph algorithms * Geometric algorithms.…

  • Lingua: Inglese

    Editore: O'Reilly Media, Sebastopol, 1999

    1565924533 / 9781565924536

    • Brossura

    Da: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 68,42

     Spedizione gratuita 
    Spedito in U.S.A.

    Quantità: 1 disponibile

    Paperback. Condizione: new. Paperback. There are many books on data structures and algorithms, including some with useful libraries of C functions. Mastering Algorithms with C offers you a unique combination of theoretical background and working code. With robust solutions for everyday programming tasks, this book avoids the abstract style of most classic data structures and algorithms texts, but still provides all of 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 included. Using both a programming style and a writing style that are exceptionally clean, Kyle Loudon shows you how to use such essential data structures as lists, stacks, queues, sets, trees, heaps, priority queues, and graphs. He explains how to use algorithms for sorting, searching, numerical analysis, data compression, data encryption, common graph problems, and computational geometry. And he describes the relative efficiency of all implementations. The compression and encryption chapters not only give you working code for reasonably efficient solutions, they offer explanations of 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 extendible 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, graphs) * Sorting and searching * Numerical methods * Data compression * Data encryption * Graph algorithms * Geometric algorithms This book offers robust solutions for everyday programming tasks, providing all the necessary information to understand and use common programming techniques. It includes implementations and real-world examples of each data structure in the text. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

  • Lingua: Inglese

    Editore: O'Reilly Media, US, 1999

    1565924533 / 9781565924536

    • Brossura

    Da: Rarewaves USA United, HEBRON, KY, U.S.A.Rarewaves USA United

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 48,08

    EUR 45,57 spedizione 
    Spedito in U.S.A.

    Quantità: Più di 20 disponibili

    Paperback. Condizione: New. There are many books on data structures and algorithms, including some with useful libraries of C functions. Mastering Algorithms with C offers you a unique combination of theoretical background and working code. With robust solutions for everyday programming tasks, this book avoids the abstract style of most classic data structures and algorithms texts, but still provides all of 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 included. Using both a programming style and a writing style that are exceptionally clean, Kyle Loudon shows you how to use such essential data structures as lists, stacks, queues, sets, trees, heaps, priority queues, and graphs. He explains how to use algorithms for sorting, searching, numerical analysis, data compression, data encryption, common graph problems, and computational geometry. And he describes the relative efficiency of all implementations.The compression and encryption chapters not only give you working code for reasonably efficient solutions, they offer explanations of 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 extendible 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, graphs) * Sorting and searching * Numerical methods * Data compression * Data encryption * Graph algorithms * Geometric algorithms.…

  • Lingua: Inglese

    Editore: O'Reilly Media, Sebastopol, 1999

    1565924533 / 9781565924536

    • Brossura

    Da: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 80,72

    EUR 33,72 spedizione 
    Spedito da Australia a U.S.A.

    Quantità: 1 disponibile

    Paperback. Condizione: new. Paperback. There are many books on data structures and algorithms, including some with useful libraries of C functions. Mastering Algorithms with C offers you a unique combination of theoretical background and working code. With robust solutions for everyday programming tasks, this book avoids the abstract style of most classic data structures and algorithms texts, but still provides all of 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 included. Using both a programming style and a writing style that are exceptionally clean, Kyle Loudon shows you how to use such essential data structures as lists, stacks, queues, sets, trees, heaps, priority queues, and graphs. He explains how to use algorithms for sorting, searching, numerical analysis, data compression, data encryption, common graph problems, and computational geometry. And he describes the relative efficiency of all implementations. The compression and encryption chapters not only give you working code for reasonably efficient solutions, they offer explanations of 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 extendible 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, graphs) * Sorting and searching * Numerical methods * Data compression * Data encryption * Graph algorithms * Geometric algorithms This book offers robust solutions for everyday programming tasks, providing all the necessary information to understand and use common programming techniques. It includes implementations and real-world examples of each data structure in the text. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…

  • Lingua: Inglese

    Editore: O'Reilly Media, US, 1999

    1565924533 / 9781565924536

    • Brossura

    Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 61,30

    EUR 77,88 spedizione 
    Spedito da Regno Unito a U.S.A.

    Quantità: 1 disponibile

    Paperback. Condizione: New. There are many books on data structures and algorithms, including some with useful libraries of C functions. Mastering Algorithms with C offers you a unique combination of theoretical background and working code. With robust solutions for everyday programming tasks, this book avoids the abstract style of most classic data structures and algorithms texts, but still provides all of 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 included. Using both a programming style and a writing style that are exceptionally clean, Kyle Loudon shows you how to use such essential data structures as lists, stacks, queues, sets, trees, heaps, priority queues, and graphs. He explains how to use algorithms for sorting, searching, numerical analysis, data compression, data encryption, common graph problems, and computational geometry. And he describes the relative efficiency of all implementations.The compression and encryption chapters not only give you working code for reasonably efficient solutions, they offer explanations of 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 extendible 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, graphs) * Sorting and searching * Numerical methods * Data compression * Data encryption * Graph algorithms * Geometric algorithms.…