Usted se encuentra revisando un registro bibliográfico de la BDU Para conocer mas sobre la Base de Datos Unificada haga click en el ícono del home

Titulos:
Algorithms in C / Robert Sedgewick
Idiomas:
eng
ISBN:
0201314525; 0201316633
Lugar de Edición:
Boston:
Editor:
Addison-Wesley,
Fecha de Edición:
1998
Edición #:
3rd ed.
Notas Formateada:
Fundamentals - Chapter 1: Introduction - Chapter 2: Principles of algortihm analysis -- Data structures - Chapter 3: Elementary data structures - Chapter 4: Abstract data types - Chapter 5: Recursion and trees -- Sorting - Chapter 6: Elementary sorting methods - Chapter 7: Quicksort - Chapter 8: Merging and mergesort - Chapter 9: Priority queues and heapsort - Chapter 10: Radix sorting - Chapter 11: Special-purpose sorts -- Searching - Chapter 12: Symbol tables and BSTs - Chapter 13: Balanced trees - Chapter 14: Hashing - Chapter 15: Radix search - Chapter 16: External searching -- Graph algorithms - Chapter 17: Graph properties and types - Chapter 18: Graph search - Chapter 19: Diagraphs and DAGs - Chapter 20: Minimun spanning trees - Chapter 21: Shortest paths - Chapter 22: Network flows
Palabras clave:

Leader:
cam
Campo 003:
AR-BaIT
Campo 008:
061204s1998t |||||||||||||||||eng
Campo 020:
^a0201314525^qv.1
Campo 020:
^a0201316633^qv.2
Campo 040:
^aITBA^cITBA
Campo 041:
0 ^aeng
Campo 100:
1 ^aSedgewick, Robert^914390
Campo 245:
10^aAlgorithms in C /^cRobert Sedgewick
Campo 246:
Campo 250:
^a3rd ed.
Campo 260:
^aBoston:^bAddison-Wesley,^c1998
Campo 300:
^a2 v.
Campo 505:
0 ^aFundamentals - Chapter 1: Introduction - Chapter 2: Principles of algortihm analysis -- Data structures - Chapter 3: Elementary data structures - Chapter 4: Abstract data types - Chapter 5: Recursion and trees -- Sorting - Chapter 6: Elementary sorting methods - Chapter 7: Quicksort - Chapter 8: Merging and mergesort - Chapter 9: Priority queues and heapsort - Chapter 10: Radix sorting - Chapter 11: Special-purpose sorts -- Searching - Chapter 12: Symbol tables and BSTs - Chapter 13: Balanced trees - Chapter 14: Hashing - Chapter 15: Radix search - Chapter 16: External searching -- Graph algorithms - Chapter 17: Graph properties and types - Chapter 18: Graph search - Chapter 19: Diagraphs and DAGs - Chapter 20: Minimun spanning trees - Chapter 21: Shortest paths - Chapter 22: Network flows
Proveniencia:
^aInstituto Tecnológico Buenos Aires (ITBA) - Biblioteca
Seleccionar y guardar el registro Haga click en el botón del carrito
Institucion:
Instituto Tecnológico Buenos Aires (ITBA)
Dependencia:
Biblioteca

Compartir este registro en Redes Sociales

Seleccionar y guardar el registro Haga click en el botón del carrito