• 教育コンテンツの分かりやすさを改善 • 9つの新しい言語を追加しました: ポルトガル語（ブラジル）、スペイン語（ラテンアメリカ）、ドイツ語、フランス語、ポーランド語、ウクライナ語、韓国語、日本語、簡体字中国語 • 起動時にUnityの短いロゴが表示されるようになりました — Unityの無料ティアに移行しました。これにより、開発コストの削減に役立っています。 • 新しいアプリアイコン & 名前

1. Union-Find Data Structure: Now available to enhance understanding of network connectivity and related challenges. 2. Kruskal’s Algorithm: Newly added to provide a robust method for computing the Minimum Spanning Tree (MST) in weighted graphs. 3. Enhanced Algorithm Code: Refined code for DFS, BFS, Prim’s MST, and Dijkstra ensures more effective learning experiences. 4. New Look: Our app icon and name have been updated to better reflect our evolving brand and mission.

The "Random" menu item has been replaced with "Examples" for both the Minimum Spanning Tree and Dijkstra's algorithm presentations. Similar to the updates made previously for DFS and BFS, each of these sections now includes four predefined examples. This change fosters a more structured and illustrative learning experience, allowing for a clear demonstration of these algorithms on specific, consistent examples.

1. Enhanced visual presentations for Bubble Sort, Selection Sort, Insertion Sort, and Quick Sort, including both Lomuto and Hoare partition schemes. Minor refinements have also been made to Merge Sort and Heap Sort to enhance learning engagement. 2. The code for all sorting algorithms has been improved for better readability.

The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience.

Expanded Hash Table Insights: The info dialog for the Hash Table topic now includes additional information, offering a deeper understanding of this data structure. Revised Hash Table Code Example: The code example for the Hash Table has been revised to enhance understanding.

Small UI Bug Fix

1. Enhanced Information Dialogues: The info dialogues for Array, Linked List, Stack, and Queue have been updated with additional information. 2. Slide Navigation Indicator: For a better learning experience during slide-like presentations on Array, Linked List, Stack, and Queue, we've added a slide navigation indicator. This new feature displays the current slide number and the total number of slides, making it easier to track your progress through the material.

We've updated the Home screen with a new look and feel to enhance your experience right from the start.

1. Self-Balancing Trees Practice: Practice inserting and deleting nodes in AVL and Red-Black trees. 2. Redesigned Inserting and Deleting in Binary Search Trees: The topics on inserting and deleting in regular binary search trees have been completely redesigned for an improved learning experience.

Fixed an issue affecting some users where the app might not unlock after purchase.

You can now select a theme for the code, tailoring the appearance to your individual preference.

1. Experience a complete redesign of the pre-order, in-order, post-order, and breadth-first binary tree traversals. Gain a deeper understanding of these traversals as you explore their workings in more detail. 2. Create custom binary trees using the new Binary Tree Constructor. Accessible from the menu, it allows you to experiment with different node values and structures. Please note that the Binary Tree Constructor is currently limited to use within the context of binary tree traversal algorithms.

1. A new feature in the data structures section - Queue - has been introduced! 2. Expanding on the current materials, new content focusing on the double-ended linked list has been added. 3. Slight revisions have been made to the "Check the Code" for Array, Linked List, and Stack. 4. Information about how arrays are stored in memory has been added.

1. Stack 2. DFS and BFS (simplified versions) have been removed from the "Graph Algorithms" section due to their redundancy 3. New Syntax Highlight

Bug fixing related to purchase status

1. Array  2. Linked list

1. Application is adapted for iPads 2. The code of algorithms can now also be viewed in Python 3. The presentation of inserting a node into BST is improved 4. The dialog responsible for creating a custom array (see sorting algorithms) is added 5. Now you can view a summary of the algorithm by clicking on the "i" button that has been added to the top bar 6. The name of the app is changed again 7. Bug fix

1. You can create your own graph and apply it to Depth-first search, Breadth-first search, Minimum Spanning Tree and Dijkstra's algorithm 2. The traversal lines have been changed. Now, these lines are dashed. Affected algorithms: DFS, BFS, pre-order, in-order, post-order, and breadth-first traversals

Minimum Spanning Tree

Dijkstra'a algorithm

1. Merge sort 2. Heap sort 3. New syntax highlighting