9798189363900 - 100 java mini exercises –book 9: algorithms —: master searching, sorting, recursion, and problem-solving step by step di code, leo (3 risultati)
- Brossura
Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 29,85
EUR 7,87 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
- Brossura
- Print on Demand
Da: California Books, Miami, FL, U.S.A.California Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 29,27
Spedizione gratuitaSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Print on Demand.
- Brossura
- Print on Demand
Da: CitiRetail, Stevenage, Regno UnitoCitiRetail
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 34,15
EUR 43,06 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: new. Paperback. Take your Java skills beyond writing code that simply works.In Book 9 of the 100 Java Mini Exercises series, you will learn how to analyze the steps a program follows, compare different solutions, and choose algorithms that are clear, reliable, and efficient.Through 100 practical, progressi…ve exercises, you will explore the essential algorithms every Java learner should understand. You will begin with traversals, accumulators, counters, maximums, minimums, and basic efficiency. From there, you will work with linear search, binary search, classic sorting methods, string algorithms, recursion, divide-and-conquer strategies, merge sort, quick sort, and complete applied challenges.Each exercise includes: a clear problem statement;a specific learning objective;complete and functional Java code;a step-by-step explanation;an algorithm note;an improvement challenge for further practice.Inside this book, you will learn how to: count iterations, comparisons, swaps, and recursive calls;search arrays using linear and binary search;find first, last, and repeated appearances;sort numbers, strings, and objects;implement bubble sort, selection sort, and insertion sort;analyze palindromes, anagrams, frequencies, and repeated characters;understand base cases and recursive calls;build recursive binary search;implement merge sort and quick sort;compare O(n), O(log n), O(n2), and O(n log n) solutions;combine multiple algorithms in realistic console applications.The book uses clear American English, gradual explanations, and fully developed examples. It is designed for self-taught programmers, students, teachers, and anyone who wants to strengthen their algorithmic thinking without getting lost in excessive mathematical theory.You do not need to memorize every solution.The goal is to recognize the patterns behind each problem, understand why an algorithm works, and develop the ability to rebuild and adapt it when needed.If you have already worked with Java fundamentals, arrays, methods, objects, collections, files, and exceptions, this book will help you take the next major step: from writing code to understanding how that code solves problems.Continue the journey and prepare for Book 10, where these algorithms will become practical tools inside complete Java console projects. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
