Data Structure & Algorithm in Rust 1.97 in 14 Days (Paperback)
Lingua: inglese
Editore: Independently Published, 2026
- Brossura
- Nuovo
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail
Venditore AbeBooks dal 12 ottobre 2005
Condizione: Nuovo
EUR 34,54
Quantità: 1 disponibile
Aggiungi al carrelloDescrizione dell’articolo da parte del venditore
Paperback. Fourteen days of drills that turn data structures and algorithms into something you can use under pressure.This is a book of problems. Every rule is stated in as few words as it can be, shown working in a short program with its real captured output, and then handed back as drills. Nothing is asserted that is not also demonstrated: every listing in the book was compiled and run with Rust 1.97.1, and every printed result was captured from that run.The programming problems build one real tool across the fourteen days. It is called tally, a command-line text index. It begins on Day 1 as a word counter and gains, day by day, a growing buffer, a document list, a query parser, a directory walk, a ranking, a heap, a sorted vocabulary, a hash index, a search tree, a trie, a graph of related terms and a comparison of two documents. Each day's tool is the previous day's with one structure added, so the reason for a structure arrives before it does.Rust is not a passenger here. Ownership decides how a linked list is written, why a tree is held in one vector rather than a Box per node, and what a deletion is allowed to touch. Those decisions are shown as measurements, not as opinions: an arena builds a hundred thousand nodes in two thirds of the time and half the memory of one Box per node, and the book prints both numbers.The two weeks run in three movements. Days 1 to 5 build the foundations: the cost model, arrays, linked lists, stacks and queues, and recursion with backtracking. Days 6 to 9 cover sorting, heaps and priority queues, searching and two pointers, and hash tables. Days 10 to 14 cover binary search trees, balanced trees and tries, graphs and traversal, shortest paths, and dynamic programming and greedy algorithms.Every chapter has the same shape. Numbered sections state the rules. Twenty worked examples show each rule running, each with a complete program, its real output, a figure and a short explanation. Then a fixed ladder of five problem sets: review questions, worked problems with full solutions, worked programming problems, and unassisted practice problems in both written and programming form. The review answers are at the end of the chapter; the practice problems have no answers anywhere, by design.YOUR 14-DAY PATHWEEK 1 - FOUNDATIONS AND SORTINGDay 1 - Complexity and the Cost ModelDay 2 - Arrays and Dynamic ArraysDay 3 - Linked ListsDay 4 - Stacks and QueuesDay 5 - Recursion and BacktrackingDay 6 - Elementary and Divide-and-Conquer SortingDay 7 - Heaps, Priority Queues and Linear-Time SortingWEEK 2 - SEARCHING, TREES, GRAPHS AND DESIGN METHODSDay 8 - Searching, Binary Search and Two PointersDay 9 - Hash TablesDay 10 - Binary Trees and Binary Search TreesDay 11 - Balanced Trees and TriesDay 12 - Graphs and TraversalDay 13 - Shortest Paths, Spanning Trees and Topological OrderDay 14 - Dynamic Programming and Greedy AlgorithmsWHO IT'S FORStudents taking a data structures course who want drills rather than a reference. Readers preparing for an examination or a technical interview. Working programmers who want fluency in the structures they already use by name. One programming language is assumed: loops, functions and arrays. No prior work on data structures is assumed. Rust is taught only where a structure needs it, so a reader who knows another language can follow the drills and pick up the language on the way.281 worked examples. 463 figures. 736 problems. 390 pages. Written to Rust 1.97.Fourteen days. Work them in order, and do the problems. This item is printed on Shipping may be from multiple locations in the US or from the UK, depending on stock availability. …
Codice articolo 9798194651733
- Titolo
- Data Structure & Algorithm in Rust 1.97 in 14 Days (Paperback)
- Autore
- Mohammad Saqib
- Editore
- Independently Published
- Anno di pubblicazione
- 2026
- Condizione
- new
- Rilegatura
- Paperback
- Lingua
- inglese
- ISBN 13
- 9798194651733
- Serie
- Libro 16 di 23: Learn Programming in 14 Days
Fourteen days of drills that turn data structures and algorithms into something you can use under pressure.
This is a book of problems. Every rule is stated in as few words as it can be, shown working in a short program with its real captured output, and then handed back as drills. Nothing is asserted that is not also demonstrated: every listing in the book was compiled and run with Rust 1.97.1, and every printed result was captured from that run.
The programming problems build one real tool across the fourteen days. It is called tally, a command-line text index. It begins on Day 1 as a word counter and gains, day by day, a growing buffer, a document list, a query parser, a directory walk, a ranking, a heap, a sorted vocabulary, a hash index, a search tree, a trie, a graph of related terms and a comparison of two documents. Each day's tool is the previous day's with one structure added, so the reason for a structure arrives before it does.
Rust is not a passenger here. Ownership decides how a linked list is written, why a tree is held in one vector rather than a Box per node, and what a deletion is allowed to touch. Those decisions are shown as measurements, not as opinions: an arena builds a hundred thousand nodes in two thirds of the time and half the memory of one Box per node, and the book prints both numbers.
The two weeks run in three movements. Days 1 to 5 build the foundations: the cost model, arrays, linked lists, stacks and queues, and recursion with backtracking. Days 6 to 9 cover sorting, heaps and priority queues, searching and two pointers, and hash tables. Days 10 to 14 cover binary search trees, balanced trees and tries, graphs and traversal, shortest paths, and dynamic programming and greedy algorithms.
Every chapter has the same shape. Numbered sections state the rules. Twenty worked examples show each rule running, each with a complete program, its real output, a figure and a short explanation. Then a fixed ladder of five problem sets: review questions, worked problems with full solutions, worked programming problems, and unassisted practice problems in both written and programming form. The review answers are at the end of the chapter; the practice problems have no answers anywhere, by design.
YOUR 14-DAY PATH
WEEK 1 - FOUNDATIONS AND SORTING
- Day 1 - Complexity and the Cost Model
- Day 2 - Arrays and Dynamic Arrays
- Day 3 - Linked Lists
- Day 4 - Stacks and Queues
- Day 5 - Recursion and Backtracking
- Day 6 - Elementary and Divide-and-Conquer Sorting
- Day 7 - Heaps, Priority Queues and Linear-Time Sorting
WEEK 2 - SEARCHING, TREES, GRAPHS AND DESIGN METHODS
- Day 8 - Searching, Binary Search and Two Pointers
- Day 9 - Hash Tables
- Day 10 - Binary Trees and Binary Search Trees
- Day 11 - Balanced Trees and Tries
- Day 12 - Graphs and Traversal
- Day 13 - Shortest Paths, Spanning Trees and Topological Order
- Day 14 - Dynamic Programming and Greedy Algorithms
WHO IT'S FOR
Students taking a data structures course who want drills rather than a reference. Readers preparing for an examination or a technical interview. Working programmers who want fluency in the structures they already use by name. One programming language is assumed: loops, functions and arrays. No prior work on data structures is assumed. Rust is taught only where a structure needs it, so a reader who knows another language can follow the drills and pick up the language on the way.
281 worked examples. 463 figures. 736 problems. 390 pages. Written to Rust 1.97.
Fourteen days. Work them in order, and do the problems.
"Riassunto" può appartenere a un’altra edizione di questo titolo.
Grand Eagle Retail
Bensenville, IL, U.S.A.
Venditore AbeBooks dal 12 ottobre 2005
Tariffe di spedizione nazionale per U.S.A.
| Articolo | Da 6 a 14 giorni lavorativi | Da 6 a 16 giorni lavorativi |
|---|---|---|
| Primo articolo | EUR 0,00 | EUR 0,00 |
Metodi di pagamento
Informazioni sull’azienda del venditore
APOLLO ONLINE CORP.
605 Geddes Street
Wilmington, DE U.S.A. 19805
Condizioni di vendita
We guarantee the condition of every book as it¿s described on the Abebooks web sites. If you¿ve changed
your mind about a book that you¿ve ordered, please use the Ask bookseller a question link to contact us
and we¿ll respond within 2 business days.
Books ship from California and Michigan.
Diritto di recesso
Se sei un consumatore puoi recedere dal contratto in conformità con quanto segue. Per Consumatore si intende qualsiasi persona fisica che agisce per scopi estranei alla propria attività commerciale, imprenditoriale, artigianale o professionale.
Informazioni sul diritto di recesso
Diritto legale di recesso
Hai il diritto di recedere dal presente contratto entro 14 giorni senza fornire alcuna motivazione.
Il periodo di recesso scade dopo 14 giorni dal giorno in cui tu o una terza parte, diversa dal vettore e da te indicata, acquisisce il possesso fisico dell'ultimo bene o dell'ultimo lotto o pezzo.
Per esercitare il diritto di recesso, compila e invia elettronicamente una dichiarazione esplicita sul nostro sito Web, alla voce “I miei acquisti” nella sezione “Mio account”. Ti comunicheremo senza indugio una conferma di ricezione di tale recesso su un supporto durevole (ad es. via e-mail).
Per rispettare il termine di recesso, è sufficiente inviare la comunicazione relativa all'esercizio del diritto di recesso prima della scadenza del periodo di recesso stesso.
Effetti del recesso
In caso di recesso dal presente contratto, ti rimborseremo tutti i pagamenti ricevuti, compresi i costi di spedizione (ad eccezione dei costi supplementari derivanti dalla tua eventuale scelta di un tipo di spedizione diverso dal tipo meno costoso di consegna standard da noi offerto).
Potremo effettuare una detrazione dal rimborso per la perdita di valore dei beni forniti, qualora tale perdita sia il risultato di una manipolazione non necessaria da parte tua.
Eseguiremo il rimborso senza indebito ritardo e non oltre 14 giorni dal giorno in cui saremo informati della tua decisione di recedere dal presente contratto.
Il rimborso sarà effettuato utilizzando lo stesso mezzo di pagamento da te usato per la transazione iniziale, salvo che tu non abbia espressamente concordato altrimenti; in ogni caso, non dovrai sostenere alcun costo quale conseguenza di tale rimborso.
Possiamo trattenere il rimborso finché non avremo ricevuto i beni oppure finché non avrai fornito la prova di averli rispediti, a seconda di quale condizione si verifichi per prima.
Dovrai rispedire i beni o consegnarli a Grand Eagle Retail, Bensenville, Illinois, U.S.A., senza indebito ritardo e, in ogni caso, entro 14 giorni dal giorno in cui ci hai comunicato la tua volontà di recedere dal presente contratto. Il termine è rispettato se rispedisci i beni prima della scadenza del periodo di 14 giorni. I costi diretti della restituzione dei beni saranno a tuo carico. Sei responsabile solo della diminuzione del valore dei beni risultante da una manipolazione diversa da quella necessaria per stabilire la natura, le caratteristiche e il funzionamento dei beni stessi.
Eccezioni al diritto di recesso
Il diritto di recesso non si applica a:
- La fornitura di giornali, periodici o riviste ad eccezione dei contratti di abbonamento; e
- La fornitura di contenuto digitale non fornito su un supporto materiale (ad es. su un CD o DVD), se al momento dell'invio dell'ordine hai accettato l'inizio dell'esecuzione e hai riconosciuto che non avresti potuto recedere una volta iniziata l'esecuzione.
Condizioni di spedizione
Orders usually ship within 2 business days. All books within the US ship free of charge. Delivery is 4-14 business days anywhere in the United States.
Books ship from California and Michigan.
If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.