Data Structure & Algorithm in C++23 in 14 Days (Paperback)
Langue : anglais
Edité par Independently Published, 2026
- Livre broché
- Neuf
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-UnisGrand Eagle Retail
Vendeur AbeBooks depuis 12 octobre 2005
Etat: Neuf
EUR 33,97
Quantité disponible : 1 disponible
Ajouter au panierA propos de cet article
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 g++ -std=c++23 -O2 -Wall -Wextra, 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 ranking, a heap, a postings list, a hash index, an ordered vocabulary, prefix search, a co-occurrence graph, related-term search and spelling suggestions. Each day's tool is the previous day's tool with one structure added, so the reason for each structure arrives before the structure does.The two weeks run in three movements. Days 1 to 5 build the foundations: the cost model, arrays and dynamic 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 spanning trees, and finally 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 with complete programs, and unassisted practice problems in both written and programming form. The answers to the review questions 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 - The Cost Model and ComplexityDay 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, where the measure is what can be produced without help. Working programmers who want fluency in the structures they already use by name. One programming language is assumed, with loops, functions and arrays. No prior work on data structures is assumed, and no mathematics beyond logarithms and summation.280 worked examples. 337 figures. About 700 problems. 396 pages. Written to C++23.Fourteen days. Work them in order, and do the problems. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…
N° de réf. du vendeur 9798193571841
- Titre
- Data Structure & Algorithm in C++23 in 14 Days (Paperback)
- Auteur
- Mohammad Saqib
- Éditeur
- Independently Published
- Année de publication
- 2026
- État de l'article
- new
- Reliure
- Paperback
- Langue
- anglais
- ISBN à 13 chiffres
- 9798193571841
- Série
- Livre 5 sur 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 g++ -std=c++23 -O2 -Wall -Wextra, 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 ranking, a heap, a postings list, a hash index, an ordered vocabulary, prefix search, a co-occurrence graph, related-term search and spelling suggestions. Each day's tool is the previous day's tool with one structure added, so the reason for each structure arrives before the structure does.
The two weeks run in three movements. Days 1 to 5 build the foundations: the cost model, arrays and dynamic 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 spanning trees, and finally 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 with complete programs, and unassisted practice problems in both written and programming form. The answers to the review questions 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 - The Cost Model and Complexity
- 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, where the measure is what can be produced without help. Working programmers who want fluency in the structures they already use by name. One programming language is assumed, with loops, functions and arrays. No prior work on data structures is assumed, and no mathematics beyond logarithms and summation.
280 worked examples. 337 figures. About 700 problems. 396 pages. Written to C++23.
Fourteen days. Work them in order, and do the problems.
« Synopsis » peut appartenir à une autre édition de cet ouvrage.
Grand Eagle Retail
Bensenville, IL, Etats-Unis
Vendeur AbeBooks depuis 12 octobre 2005
Frais d'expédition à l'intérieur de ce pays : Etats-Unis
| Article | 6 à 14 jours ouvrés | 6 à 16 jours ouvrés |
|---|---|---|
| Premier article | EUR 0,00 | EUR 0,00 |
Modes de paiement
Profil professionnel du vendeur
APOLLO ONLINE CORP.
605 Geddes Street
Wilmington, DE Etats-Unis 19805
Conditions de vente
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.
Droit de rétractation
Si vous êtes un consommateur, vous pouvez exercer votre droit de rétractation sur le contrat conformément à ce qui suit. Le mot « consommateur » désigne toute personne physique agissant à des fins qui n'entrent pas dans le cadre de son activité commerciale, artisanale ou professionnelle.
Informations concernant le droit de rétractation
Droit statutaire de rétractation
Vous avez le droit d'exercer votre droit de rétractation sur ce contrat dans les 14 jours sans donner de raison.
Le délai de rétractation expirera au bout de 14 jours à compter du jour où vous-même, ou un tiers autre que le transporteur et désigné par vous, prendrez physiquement possession de la dernière marchandise, du dernier lot ou de la dernière pièce.
Pour exercer votre droit de rétractation, remplissez électroniquement et envoyez une déclaration claire sur notre site Web, sous « Vos achats » dans « Votre compte ». Nous vous communiquerons sans délai un accusé de réception de cette rétractation sur un support durable (par exemple, par e-mail).
Pour respecter le délai de rétractation, il vous suffit d'envoyer votre message concernant l'exercice de votre droit de rétractation avant l'expiration du délai de rétractation.
Effets de la rétractation
Si vous exercez votre droit de rétractation sur ce contrat, nous vous rembourserons tous les paiements que vous avez effectués, y compris les frais de livraison (à l'exception des frais supplémentaires résultant du choix d'un mode de livraison autre que le type de livraison standard le moins cher que nous proposons).
Nous pouvons déduire du remboursement la perte de valeur de toute marchandise livrée, si la perte est le résultat d'une manipulation inutile de votre part.
Nous effectuerons le remboursement dans les meilleurs délais, et au plus tard 14 jours après le jour où nous aurons été informés de votre décision d'exercer votre droit de rétractation sur ce contrat.
Nous effectuerons le remboursement en utilisant le même moyen de paiement que celui que vous avez utilisé pour la transaction initiale, sauf si vous en avez expressément convenu autrement ; en tout état de cause, aucuns frais ne vous seront facturés à la suite d'un tel remboursement.
Nous pouvons suspendre le remboursement jusqu'à ce que nous ayons reçu les marchandises ou que vous ayez fourni la preuve que vous avez renvoyé les marchandises, en fonction de la première éventualité.
Vous devez renvoyer les marchandises ou les remettre à Grand Eagle Retail, Bensenville, Illinois, U.S.A., sans retard injustifié et, en tout état de cause, au plus tard 14 jours à compter du jour où vous nous avez communiqué votre décision de rétractation du présent contrat. Le délai est respecté si vous renvoyez les marchandises avant l'expiration du délai de 14 jours. Vous devrez prendre en charge les frais directs du renvoi des marchandises. Vous n'êtes responsable que de toute diminution de valeur des marchandises résultant d'une manipulation autre que celle nécessaire pour établir la nature, les caractéristiques et le fonctionnement des marchandises.
Exceptions au droit de rétractation
Le droit de rétractation ne s'applique pas à ce qui suit :
- Distribution de journaux, de revues ou de magazines, à l'exception des contrats d'abonnement ; et
- Fourniture d'un contenu numérique qui n'est pas fourni sur un support matériel (par exemple, sur un CD ou un DVD) si vous avez accepté, lors de votre commande, que nous puissions commencer à le livrer et que vous ne puissiez pas exercer votre droit de rétractation une fois la livraison commencée.
Conditions d'expédition
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.