About Algorithms and Data Structures
The application provides comprehensible content on the study of computer algorithms with a focus on interactivity and visualization of each step. By using controls the user goes through the algorithm while observing its...
The application provides comprehensible content on the study of computer algorithms with a focus on interactivity and visualization of each step. By using controls the user goes through the algorithm while observing its work.
The current version of the application covers the following basic computer algorithms and data structures:
I. DATA STRUCTURES
- Array,
- Linked List,
- Stack,
- Queue
II. SORTING
- Bubble sort,
- Selection sort,
- Insertion sort,
- Merge sort,
- Heap sort,
- Quick sort
III. BINARY SEARCH TREE
- Pre-order traversal,
- In-order traversal,
- Post-order traversal,
- Breadth-first traversal,
- Inserting and deleting a node in Binary Search Trees (BST),
- Inserting and deleting a node in Self-Balancing Trees (AVL and Red-Black Trees)
IV. HASH-TABLE (chaining technique)
- Inserting data into a Hash-table,
- Deleting data from a Hash-table
V. GRAPH
- Depth-first search,
- Breadth-first search,
- Minimum Spanning Tree,
- Dijkstra's algorithm,
- Graph Constructor
The visualization of the algorithms and data structures is accompanied by a piece of code that shows its implementations. There is a direct link between the code and the visualization. The full code of each algorithm can be found by the link to a third-party Internet resource. Although the given code is written in Java and Python, the explanation and visualization of the algorithms are in no way tied to a specific programming language.
Algorithms and Data Structures Interactive Course is designed for a wide range of users and does not require any programming skills to understand this or that algorithm. The app may also interest experienced programmers, as it enables users with quick and efficient revision of the above algorithms.
The advantage of Algorithms and Data Structures Interactive Course in comparison to other numerous resources for learning algorithms (books, presentations and videos), is that it helps master the material with minimal waste of time since while the user is observing the visual effect at every step, he or she is being involved in the algorithm. There is no need to pause or rewind in order to comprehend the idea of a lecturer as it happens with video-content. The speed of advancement in the Algorithms and Data Structures Interactive Course training program depends on the pace of the user, and not on the speed of a video clip.
Previous Versions
Here you can find the changelog of Algorithms and Data Structures since it was posted on our website on 2021-12-11 20:14:55.
The latest version is 1.13.4 and it was updated on 2024-04-19 17:58:17. See below the changes in each version.
Algorithms and Data Structures version 1.13.4
Updated At: 2024-03-28
Changes: The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience.
Algorithms and Data Structures version 1.13.3
Updated At: 2024-03-11
Changes: 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.
Algorithms and Data Structures version 1.13.2
Updated At: 2024-02-29
Changes: 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.
Algorithms and Data Structures version 1.13.0
Updated At: 2024-02-08
Changes: 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.
Algorithms and Data Structures version 1.12.2
Updated At: 2023-09-07
Changes: You can now select a theme for the code, tailoring the appearance to your individual preference.
Algorithms and Data Structures version 1.12.1
Updated At: 2023-08-28
Changes: Important internal updates have been made to align with the latest Google Play policies
Algorithms and Data Structures version 1.12.0
Updated At: 2023-08-28
Changes: 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.
Algorithms and Data Structures version 1.11.0
Updated At: 2023-05-22
Changes: 1.
Queue Implementation
: A new feature in the data structures section - Queue - has been introduced!
2.
Double-Ended Linked List Material
: Expanding on the current materials, new content focusing on the double-ended linked list has been added.
3.
Updates to "Check the Code" Screen
: Slight revisions have been made to the "Check the Code" for Array, Linked List, and Stack.
4.
Array Memory Allocation
: Information about how arrays are stored in memory has been added.
Algorithms and Data Structures version 1.10.0
Updated At: 2023-03-19
Changes: 1. Stack
2. DFS and BFS (simplified versions) have been removed from the "Graph Algorithms" section due to their redundancy
3. New Syntax Highlight
Algorithms and Data Structures version 1.7.0
Updated At: 2022-03-31
Changes: 1. Application is adapted for tablets
2. The code of algorithms can now also be viewed in Python
3. The presentation of inserting a node into BST is improved
4. A small improvement has been made to the dialog responsible for creating a custom array (see sorting algorithms). In particular, you can jump to a given array element by clicking on it
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
Disclaimer
Official Google Play Link
We do not host Algorithms and Data Structures on our servers. We did not scan it for viruses, adware, spyware or other type of malware. This app is hosted by Google and passed their terms and conditions to be listed there. We recommend caution when installing it.
The Google Play link for Algorithms and Data Structures is provided to you by apps112.com without any warranties, representations or guarantees of any kind, so access it at your own risk.
If you have questions regarding this particular app contact the publisher directly. For questions about the functionalities of apps112.com contact us.
