-----------------
Chapter 1: Algorithm Basics
-----------------
__01-1 What is an algorithm?
Find the maximum value of ____ integers
____Conditional statements and branches
____Looking at the flowchart symbols

__01-2 Iterative Algorithm
Find the sum of integers from ____1 to n
____Sorting values ​​to find the sum of consecutive integers
____Judging conditions during the iteration process 1
____Judging conditions during the iteration process 2
____Judging conditions during the iteration process 3
____Accept only positive numbers
Finding the side length of a ____rectangle using its area
____Skipping loops and scanning multiple ranges
____Learn about multi-loops

-----------------
Chapter 2 Basic Data Structures and Arrays
-----------------
__02-1 Data Structures and Arrays
____Learning about array concepts
____Learn about lists and tuples
Accessing elements by ____index
____Accessing elements by slicing
Learn the concept of ____data structures

__02-2 What is an array?
Finding the maximum value of an array element
Implement a function to find the maximum value of an array element
____Comments and data type hints
____Writing reusable modules
Testing the ____ module
____Sort array elements in reverse order
Converting base ____ (Finding base n)
Listing ____primes

-----------------
Chapter 3 Search Algorithm
-----------------
__03-1 What is a search algorithm?
____Search and Key
____Type of search

__03-2 Linear search
____Linear search
____Sentinel Law

__03-3 Binary Search
____binary search
____Complexity

__03-4 Hash method
____Adding elements to a sorted array
____hash method
____hash collision
____chain method
____Open Address Law

-----------------
Chapter 4 Stacks and Queues
-----------------
__04-1 What is a stack?
Learn about the ____stack
Implementing a ____stack
____Creating a stack program

__04-2 What is a queue?
____Get to know the queue
Implementing a queue with an array of ____
Implementing a queue with a ring buffer
____Creating a queue program with a ring buffer

-----------------
Chapter 5 Recursive Algorithms
-----------------
__05-1 Basics of Recursive Algorithms
____Learn about recursion
____Learn about factorial
____Learning about Euclidean algorithm

__05-2 Analysis of recursive algorithms
____Two Analysis Methods for Recursive Algorithms
Non-recursive representation of a ____recursive algorithm

__05-3 Tower of Hanoi
____Learn about Hanoi's towers

__05-4 8 Queens Problem
Learn the ____8 Queen Problem
____Place the Queen
Solving problems with ____ branch work
____Limited work and branching limitation
Creating a program to solve the ____8 queen problem

-----------------
Chapter 6 Sorting Algorithms
-----------------
__06-1 Sorting Algorithm
What is ____alignment?

__06-2 Bubble Sort
____Learn about bubble sort
____Learn about Shaker Alignment

__06-3 Simple selection sort
____Learn about simple selection sort

__06-4 Simple insertion sort
____Learn about simple insertion sort

__06-5 Shell Sort
____Problem with simple insertion sort
____Learn about shell sort

__06-6 Quick sort
____Learn about quick sort
Divide the ____array into two groups
____Creating a quick sort
____Creating a non-recursive quicksort
____Choose a pivot
____Time complexity of quick sort

__06-7 Merge Sort
____Merge the sorted arrays
____Creating a merge sort

__06-8 Heap Sort
____Learn about heap sort
____Features of heap sort
Reconstructing the heap with the ____root deleted
____Learn about the heap sort algorithm
____Making an array into a heap
____Time complexity of heap sort

__06-9 Degree Sort
Learn about ____degree alignment

-----------------
Chapter 7 String Search
-----------------
__07-1 Brute force method
What is ____string search?
____Learn about brute force

__07-2 KMP Law
____Learn about the KMP method

__07-3 Boyer-Moore Act
____Learn about the Boyer-Moore Act
Time complexity of the ____string search algorithm

-----------------
Chapter 8 List
-----------------
__08-1 linked list
____Learn about linked lists
Creating a linked list with an ____ array

__08-2 Linked list using pointers
Creating a linked list with ____pointers
Creating a linked list program using ____ pointers

__08-3 Linked list using cursor
Creating a linked list with ____cursor
Handling empty elements in an ____array
____Free List
____Creating a linked list program with a cursor

__08-4 Circular Doubly Linked List
____Learn about circular lists
____Double linked list
____Circular doubly linked list
____Creating a circular doubly linked list
____Creating a circular doubly linked list program

-----------------
Chapter 9 Tree
-----------------
__09-1 Tree structure
Structure of the ____ tree and related terms
____Ordered tree and unordered tree
Searching the ____order tree

__09-2 Binary Trees and Binary Search Trees
____Learn about binary trees
____Learn about complete binary trees
____Learn about binary search trees
____Creating a binary search tree
____Creating a binary search tree program

Search

-----------------------------------
Build a solid foundation in 'data structures and algorithms'
Increase your development skills by 200% with Python!
-----------------------------------
Are you paralyzed by interview questions like, "Implement factorial using recursive function calls" or "Implement a queue in 5 minutes?" You understand it intellectually, but can't express it in code? This book is for you! Master the concepts with the author's helpful explanations and 213 illustrations.
Then, you'll work through 136 hands-on examples, type in your own code, and run the program to see how it works.
As you read with your eyes and type in the code line by line, data structures and algorithms will soon become yours.

-----------------------------------
Winner of the Engineering Education Association's Author Award, a master of basic programming education!
The complete edition of Professor Boyo Shibata's "Do it! Introduction to Algorithms with Data Structures"!
-----------------------------------
Data structures and algorithms are fields that even people who have studied the basics of programming languages ​​find difficult.
Why is that? Because there's so much to know.
In such cases, you should first study the key concepts that you need to learn in order.
The author of this book is a leading authority on programming education books, having won the Society for Engineering Education's Author's Award.
By following the explanations of Professor Boyo Shibata, who has accumulated decades of expertise, you will soon have a solid foundation in data structures and algorithms.

-----------------------------------
Why are more and more test takers choosing 'Python' for coding exams?
Prepare for various algorithm exams with Python, which is concise and fast!
-----------------------------------
These days, more and more applicants are choosing Python for coding tests at companies.
Because Python allows you to write code more concisely and quickly than other programming languages.
This book writes the entire process of implementing data structures and algorithms in Python and explains the contents in detail.
You will also get ample practice understanding the core concepts of Python and applying them accurately in your code.
Therefore, this book provides clear answers to those preparing for coding exams or wanting to solve algorithmic problems with Python.
By the end of this book, you'll be able to write your own data structures and algorithms in Python for your own programs.

-----------------------------------
213 pictures and tables
Understand data structures and algorithms more easily!
-----------------------------------
Even things that are difficult to understand just by looking at the code can be easily understood by looking at the picture.
This book explains the core content of practical example code using figures and tables.
You can visually check the execution order of the code by sequentially expressing explanations and pictures according to the numbers or symbols assigned to the code.
And when explaining concepts, we actively use diagrams so that data structure and algorithm concepts, which were previously difficult and rigid to understand, will become firmly established.

-----------------------------------
Easy and friendly Do it! series learning design
16-week progress chart provided! Recommended for both self-study and textbook use!
-----------------------------------
The 16-week completion schedule provided in this book is structured similarly to the 'Data Structures and Algorithms Course Syllabus'.
Fill in the 'Completion Date' on the progress chart and study as if you were attending a lecture at a university.
Basic concepts that must be studied are marked with speech bubbles on the progress chart.
If you follow the 16-week course in this book, data structures and algorithms, which previously seemed vaguely difficult, will no longer seem like a burden.

-----------------------------------
Learn, share, and grow together
Study in the Doit Study Room
-----------------------------------
If you plan and study alone, you will quickly become tired.
In such cases, why not meet readers who share similar concerns and share your challenges? It'll be even more rewarding and fulfilling to be able to help others with what you've diligently studied.
Meet study partners at Doit Study Room and improve your academic achievements!
* Doit Study Room: cafe.naver.com/doitstudyroom

※ All practice files for this book can be downloaded from the data room on the Aegis Publishing website.
- Easy Publishing website: www.easyspub.co.kr/Main/PUB ▶ Click [Data Room] and search by book title.


★ Target audience for this book
· People who know and have experience using Python, but are not familiar with data structures and algorithms.
Developers who have basic knowledge of algorithms but want to learn how to implement them in Python
· Job seekers preparing for algorithm competitions or coding tests at IT companies
· College students who want to get an A+ in their algorithms course

★ Key features of this book
· The core theories and concepts of data structures and algorithms are explained in an easy and friendly manner with 213 illustrations.
· After learning the theory, practice is essential! Make the code your own with 136 [Do it! Practices]!
· Python concepts and code analysis are a bonus! Conquer Python with the [Supplementary Lessons] and [Just a Little More!] sections!