- Home ›
- Apps ›
- Education ›
- Algorithms and Data Structures APK ›
- Download Algorithms and Data Structures versions history
Algorithms and Data Structures
Algorithms and Data Structures version history
‹ General Info| Version | 1.5.0 |
| Updated | 2 years ago |
| Changelog | 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 |
| Version | 1.4.0 |
| Updated | 2 years ago |
| Changelog | Minimum Spanning Tree |
| Version | 1.13.4 |
| Updated | 1 month ago |
| Changelog | The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. |
| Version | 1.13.3 |
| Updated | 1 month ago |
| Changelog | 1. Expanded Hash Table Insights: The info dialog for the Hash Table topic now includes additional information, offering a deeper understanding of this data structure. 2. Revised Hash Table Code Example: The code example for the Hash Table has been revised to enhance understanding. |
| Version | 1.13.2 |
| Updated | 2 months ago |
| Changelog | 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. |
| Version | 1.13.1 |
| Updated | 2 months ago |
| Changelog | We've updated the Home screen with a new look and feel to enhance your experience right from the start. |
| Version | 1.13.0 |
| Updated | 2 months ago |
| Changelog | 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. |
| Version | 1.12.2 |
| Updated | 8 months ago |
| Changelog | You can now select a theme for the code, tailoring the appearance to your individual preference. |
| Version | 1.12.1 |
| Updated | 8 months ago |
| Changelog | Important internal updates have been made to align with the latest Google Play policies |
| Version | 1.12.0 |
| Updated | 10 months ago |
| Changelog | 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. |
