VisiGrab: Algorithms & DSA1.23.0 - App Store

Bitte warten ... Die Verfügbarkeit der App-Liste wird überprüft.
Sie können Ergebnisse sehen in einige Sekunden.


Herausgeberbeschreibung

VisiGrab ist dein interaktiver DSA-Visualisierer — der einfachste Weg, Python-Codierung, Java und C++-Programmierung durch visuelle Schritt-für-Schritt-Animationen zu meistern. Ideal für Informatikstudenten, Quereinsteiger und erfahrene Entwickler.

Warum VisiGrab?

Der wahre Wert von VisiGrab liegt nicht nur im Inhalt selbst — den man überall kostenlos im Internet finden kann —, sondern in der Art und Weise, wie du ihn erlebst und verarbeitest.

Das Studieren von Datenstrukturen aus unstrukturierten Quellen fühlt sich oft an wie das blinde Wandern durch eine dunkle Höhle. VisiGrab fungiert als dein Guide, der dich an die Hand nimmt und dich sicher über die gewundenen Pfade ans Licht führt.

Es ist auch das optimale Werkzeug, um das Hochstapler-Syndrom (Imposter Syndrome) zu überwinden. Viele talentierte Programmierer fühlen sich verunsichert, weil ihnen ein akademischer Hintergrund fehlt. VisiGrab nimmt diese Angst, indem es grundlegende Informatikkonzepte so intuitiv darstellt, dass sie endlich im Kopf Klick machen.

Als Lernender hast du die Wahl: Entweder du verschwendest Wochen damit, dich durch ungeordnete Tutorials zu wühlen, oder du baust in wenigen Tagen ein felsenfestes Fundament auf. Zeit ist deine wertvollste Ressource, und diese App spart sie. Durch die Bereitstellung der Inhalte in einer Schritt-für-Schritt-Reihenfolge baut VisiGrab eine zusammenhängende mentale Landkarte in deinem Kopf auf und macht dich zu einem selbstbewussten Entwickler.

Umfassende DSA-Abdeckung

Datenstrukturen:
• Array, Linked List, Doubly Linked List
• Stack, Queue, Min-Heap
• Hash Table (Chaining & Open-Addressing-Techniken)
• Binary Search Tree (BST) & Trie
• AVL-Baum & Rot-Schwarz-Baum
• B-Baum
• Graph & Graph Constructor (baue deine eigenen Graphen)

Sortierung & Operationen:
• Bubble, Selection, Insertion, Merge, Heap, Quick Sort
• Baum-Traversierung: Pre-order, In-order, Post-order und Breadth-first (BFS)
• Einfügen und Löschen von Knoten in BST, AVL und Rot-Schwarz-Bäumen
• Graphen-Algorithmen: Depth-first search (DFS) & Dijkstra-Algorithmus
• Bellman-Ford, Prim und Kruskal
• Topologische Sortierung & Union-Find

Code-Beispiele in Java, Python und C++

Jede visuelle DSA-Animation wird von ihrem Implementierungscode in Java, Python und C++ begleitet. Sieh die direkte Verbindung zwischen dem Code und der Animation — verstehe, wie das Programm das Konzept umsetzt. Vollständiger Quellcode auf GitHub verfügbar.

In 10 Sprachen verfügbar

VisiGrab unterstützt Englisch, Deutsch, Französisch, Spanisch, Portugiesisch, Polnisch, Ukrainisch, Japanisch, Koreanisch und Chinesisch (vereinfacht).

Perfekt für die Vorbereitung auf Coding-Interviews

Bereitest du dich auf dein nächstes technisches Interview vor? VisiGrab hilft dir, die DSA-Themen visuell zu erfassen, die in Interviews am häufigsten abgefragt werden. Baue ein starkes Fundament auf und gehe mit Vertrauen in dein Interview. Ideal für LeetCode-Praxis und universitäre Prüfungen.

Hauptmerkmale

• Interaktive visuelle Animationen für jeden Baum, Graphen und jede Datenstruktur
• Schritt-für-Schritt-Ausführung — Pause, Zurückspulen und Tempokontrolle
• Code-Ansicht mit Java-, Python- und C++-Implementierungen
• Offline-Zugriff — lerne überall, kein Internet erforderlich
• Einmaliger Kauf — keine Abonnements, keine Werbung, keine wiederkehrenden Gebühren

Lade VisiGrab noch heute herunter und meistere Datenstrukturen visuell!



Über VisiGrab: Algorithms & DSA

VisiGrab: Algorithms & DSA ist eine free App für iOS, veröffentlicht in der App-Liste Teaching & Training Tools, die Teil von Education ist.

Das Unternehmen, das VisiGrab: Algorithms & DSA entwickelt, ist Ievgen Ovsii. Die neueste vom Entwickler veröffentlichte Version ist 1.23.0.

Um VisiGrab: Algorithms & DSA auf Ihrem iOS-Gerät zu installieren, klicken Sie einfach auf die grüne Schaltfläche Weiter zur App oben, um den Installationsvorgang zu starten. Die App ist seit 2026-09-25 auf unserer Website gelistet und wurde 0 Mal heruntergeladen. Wir haben bereits geprüft, ob der Download-Link sicher ist; zu Ihrem eigenen Schutz empfehlen wir jedoch, die heruntergeladene App mit Ihrem Antivirusprogramm zu scannen. Ihr Antivirusprogramm kann VisiGrab: Algorithms & DSA als Malware erkennen, wenn der Download-Link defekt ist.

So installieren Sie VisiGrab: Algorithms & DSA auf Ihrem iOS-Gerät:

  • Klicken Sie auf unserer Website auf die Schaltfläche Weiter zur App. Dadurch werden Sie zum App Store weitergeleitet.
  • Sobald VisiGrab: Algorithms & DSA im iTunes-Eintrag Ihres iOS-Geräts angezeigt wird, können Sie den Download und die Installation starten. Tippen Sie rechts neben der App auf die Schaltfläche LADEN, um den Download zu starten.
  • Wenn Sie nicht in der iOS App Store App angemeldet sind, werden Sie nach Ihrer Apple-ID und/oder Ihrem Passwort gefragt.
  • Nachdem VisiGrab: Algorithms & DSA heruntergeladen wurde, sehen Sie rechts einen INSTALLIEREN-Button. Tippen Sie darauf, um die eigentliche Installation der iOS-App zu starten.
  • Sobald die Installation abgeschlossen ist, können Sie auf die Schaltfläche ÖFFNEN tippen, um sie zu starten. Das Symbol wird außerdem zum Startbildschirm Ihres Geräts hinzugefügt.

Programmdetails


Allgemein

Herausgeber
Veröffentlichungsdatum
2026-09-25
Sprachen
German

Kategorie

Kategorie
Unterkategorie

Systemanforderungen

Betriebssysteme
iOS

Download-Informationen

Dateigröße
341.2 MB
Gesamtdownloads
0

Preisgestaltung

Lizenzmodell
Free
Preis

Versionsgeschichte


Hier finden Sie das Changelog von VisiGrab: Algorithms & DSA, seit es am 2026-10-31 auf unserer Website veröffentlicht wurde.Die neueste Version ist 1.23.0 und wurde am 04 November, 2026 auf Apps112 aktualisiert.Sehen Sie unten die Änderungen in jeder Version:

Version 1.23.0

veröffentlicht am 2026-09-25

B-Baum hinzugefügt — Schlüssel einfügen und löschen, den maximalen Grad wählen und zusehen, wie Knoten sich spalten, von Nachbarn borgen und verschmelzen

Version 1.23.0

veröffentlicht am 2026-10-15

Version History Added B-Tree — add and remove keys, choose the maximum degree, and watch the nodes split, borrow and merge 1.23.0 Sep 25 • Added end-of-topic quizzes to every remaining topic — sorting algorithms, trees, traversals, and graph algorithms
• Heap: build-heap now runs step by step from the info dialog, showing every comparison and swap 1.22.0 Aug 28 • Rebuilt the Hash Table topic as a slide-show presentation — reworked separate chaining and added open addressing, with insert, search, and delete
• Long-press a topic on the home screen to mark it as learned 1.21.0 Aug 16 Added Min-Heap 1.20.0 Jul 22 Added end-of-topic quizzes for Array, Linked List, Doubly Linked List, Queue, and Stack — open one anytime from the menu 1.19.0 Jul 2 Added Doubly Linked List 1.18.0 Jun 29 Added C++ as a third programming language — view any topic's code in Java, Python, or C++. 1.17.0 Jun 13 • Added a "Slides" table of contents to Array, Linked List, Stack, and Queue presentations — tap any row to jump straight to that slide.
• These presentations now remember your last opened slide. Restart in the menu jumps back to the first slide. 1.16.0 Jun 7 Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations. 1.15.0 May 25 Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm
- Expanded Dijkstra info dialog
- Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name 1.12.0 12/09/2025 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. 1.11.0 08/15/2024 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.10.7 05/14/2024 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. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 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. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 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. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 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. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023

Version 1.23.0

veröffentlicht am 2026-10-01

Version History Added B-Tree — add and remove keys, choose the maximum degree, and watch the nodes split, borrow and merge 1.23.0 6d ago • Added end-of-topic quizzes to every remaining topic — sorting algorithms, trees, traversals, and graph algorithms
• Heap: build-heap now runs step by step from the info dialog, showing every comparison and swap 1.22.0 Aug 28 • Rebuilt the Hash Table topic as a slide-show presentation — reworked separate chaining and added open addressing, with insert, search, and delete
• Long-press a topic on the home screen to mark it as learned 1.21.0 Aug 16 Added Min-Heap 1.20.0 Jul 22 Added end-of-topic quizzes for Array, Linked List, Doubly Linked List, Queue, and Stack — open one anytime from the menu 1.19.0 Jul 2 Added Doubly Linked List 1.18.0 Jun 29 Added C++ as a third programming language — view any topic's code in Java, Python, or C++. 1.17.0 Jun 13 • Added a "Slides" table of contents to Array, Linked List, Stack, and Queue presentations — tap any row to jump straight to that slide.
• These presentations now remember your last opened slide. Restart in the menu jumps back to the first slide. 1.16.0 Jun 7 Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations. 1.15.0 May 25 Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm
- Expanded Dijkstra info dialog
- Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name 1.12.0 12/09/2025 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. 1.11.0 08/15/2024 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.10.7 05/14/2024 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. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 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. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 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. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 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. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023

Version 1.22.0

veröffentlicht am 2026-09-24

Version History • Added end-of-topic quizzes to every remaining topic — sorting algorithms, trees, traversals, and graph algorithms
• Heap: build-heap now runs step by step from the info dialog, showing every comparison and swap 1.22.0 Aug 28 • Rebuilt the Hash Table topic as a slide-show presentation — reworked separate chaining and added open addressing, with insert, search, and delete
• Long-press a topic on the home screen to mark it as learned 1.21.0 Aug 16 Added Min-Heap 1.20.0 Jul 22 Added end-of-topic quizzes for Array, Linked List, Doubly Linked List, Queue, and Stack — open one anytime from the menu 1.19.0 Jul 2 Added Doubly Linked List 1.18.0 Jun 29 Added C++ as a third programming language — view any topic's code in Java, Python, or C++. 1.17.0 Jun 13 • Added a "Slides" table of contents to Array, Linked List, Stack, and Queue presentations — tap any row to jump straight to that slide.
• These presentations now remember your last opened slide. Restart in the menu jumps back to the first slide. 1.16.0 Jun 7 Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations. 1.15.0 May 25 Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm
- Expanded Dijkstra info dialog
- Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name 1.12.0 12/09/2025 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. 1.11.0 08/15/2024 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.10.7 05/14/2024 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. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 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. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 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. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 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. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023 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.9.0 06/29/2023

Version 1.22.0

veröffentlicht am 2026-09-03

Version History • Added end-of-topic quizzes to every remaining topic — sorting algorithms, trees, traversals, and graph algorithms
• Heap: build-heap now runs step by step from the info dialog, showing every comparison and swap 1.22.0 5d ago • Rebuilt the Hash Table topic as a slide-show presentation — reworked separate chaining and added open addressing, with insert, search, and delete
• Long-press a topic on the home screen to mark it as learned 1.21.0 Aug 16 Added Min-Heap 1.20.0 Jul 22 Added end-of-topic quizzes for Array, Linked List, Doubly Linked List, Queue, and Stack — open one anytime from the menu 1.19.0 Jul 2 Added Doubly Linked List 1.18.0 Jun 29 Added C++ as a third programming language — view any topic's code in Java, Python, or C++. 1.17.0 Jun 13 • Added a "Slides" table of contents to Array, Linked List, Stack, and Queue presentations — tap any row to jump straight to that slide.
• These presentations now remember your last opened slide. Restart in the menu jumps back to the first slide. 1.16.0 Jun 7 Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations. 1.15.0 May 25 Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm
- Expanded Dijkstra info dialog
- Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name 1.12.0 12/09/2025 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. 1.11.0 08/15/2024 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.10.7 05/14/2024 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. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 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. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 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. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 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. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023 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.9.0 06/29/2023

Version 1.20.0

veröffentlicht am 2026-08-12

Version History Added Min-Heap 1.20.0 Jul 22 Added end-of-topic quizzes for Array, Linked List, Doubly Linked List, Queue, and Stack — open one anytime from the menu 1.19.0 Jul 2 Added Doubly Linked List 1.18.0 Jun 29 Added C++ as a third programming language — view any topic's code in Java, Python, or C++. 1.17.0 Jun 13 • Added a "Slides" table of contents to Array, Linked List, Stack, and Queue presentations — tap any row to jump straight to that slide.
• These presentations now remember your last opened slide. Restart in the menu jumps back to the first slide. 1.16.0 Jun 7 Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations. 1.15.0 May 25 Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm
- Expanded Dijkstra info dialog
- Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name 1.12.0 12/09/2025 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. 1.11.0 08/15/2024 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.10.7 05/14/2024 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. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 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. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 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. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 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. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023 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.9.0 06/29/2023 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.8.0 05/24/2023 1. Stack
2. DFS and BFS (simplified versions) have been removed from the "Graph Algorithms" section due to their redundancy
3. New Syntax Highlight 1.7.0 03/17/2023

Version 1.20.0

veröffentlicht am 2026-07-23

Version History Added Min-Heap 1.20.0 22h ago Added end-of-topic quizzes for Array, Linked List, Doubly Linked List, Queue, and Stack — open one anytime from the menu 1.19.0 Jul 2 Added Doubly Linked List 1.18.0 Jun 29 Added C++ as a third programming language — view any topic's code in Java, Python, or C++. 1.17.0 Jun 13 • Added a "Slides" table of contents to Array, Linked List, Stack, and Queue presentations — tap any row to jump straight to that slide.
• These presentations now remember your last opened slide. Restart in the menu jumps back to the first slide. 1.16.0 Jun 7 Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations. 1.15.0 May 25 Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm
- Expanded Dijkstra info dialog
- Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name 1.12.0 12/09/2025 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. 1.11.0 08/15/2024 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.10.7 05/14/2024 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. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 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. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 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. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 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. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023 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.9.0 06/29/2023 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.8.0 05/24/2023 1. Stack
2. DFS and BFS (simplified versions) have been removed from the "Graph Algorithms" section due to their redundancy
3. New Syntax Highlight 1.7.0 03/17/2023

Version 1.18.0

veröffentlicht am 2026-07-02

Version History Added Doubly Linked List 1.18.0 2d ago Added C++ as a third programming language — view any topic's code in Java, Python, or C++. 1.17.0 Jun 13 • Added a "Slides" table of contents to Array, Linked List, Stack, and Queue presentations — tap any row to jump straight to that slide.
• These presentations now remember your last opened slide. Restart in the menu jumps back to the first slide. 1.16.0 Jun 7 Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations. 1.15.0 May 25 Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm
- Expanded Dijkstra info dialog
- Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name 1.12.0 12/09/2025 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. 1.11.0 08/15/2024 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.10.7 05/14/2024 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. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 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. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 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. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 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. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023 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.9.0 06/29/2023 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.8.0 05/24/2023 1. Stack
2. DFS and BFS (simplified versions) have been removed from the "Graph Algorithms" section due to their redundancy
3. New Syntax Highlight 1.7.0 03/17/2023 Bug fixing related to purchase status 1.6.1 01/16/2023 1. Array 
2. Linked list 1.6.0 01/16/2023

Version 1.17.0

veröffentlicht am 2026-06-20

Version History Added C++ as a third programming language — view any topic's code in Java, Python, or C++. 1.17.0 6d ago • Added a "Slides" table of contents to Array, Linked List, Stack, and Queue presentations — tap any row to jump straight to that slide.
• These presentations now remember your last opened slide. Restart in the menu jumps back to the first slide. 1.16.0 Jun 7 Added Trie data structure with Insert, Delete, and StartsWith (Autocomplete) operations. 1.15.0 May 25 Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm
- Expanded Dijkstra info dialog
- Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name 1.12.0 12/09/2025 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. 1.11.0 08/15/2024 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.10.7 05/14/2024 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. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 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. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 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. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 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. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023 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.9.0 06/29/2023 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.8.0 05/24/2023 1. Stack
2. DFS and BFS (simplified versions) have been removed from the "Graph Algorithms" section due to their redundancy
3. New Syntax Highlight 1.7.0 03/17/2023 Bug fixing related to purchase status 1.6.1 01/16/2023 1. Array 
2. Linked list 1.6.0 01/16/2023 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.5.0 04/04/2022

Version 1.14.0

veröffentlicht am 2026-05-18

Version History Added Topological Sort (Kahn's algorithm) with graph constructor integration. 1.14.0 May 6 Added Bellman-Ford to graph constructor 1.13.2 Apr 12 Improved value input widget across Sorting Algorithms and Graph Constructor 1.13.1 Apr 5 - Added Bellman-Ford algorithm
- Expanded Dijkstra info dialog
- Code section: Replit replaced with GitHub link 1.13.0 Mar 25 • Improved clarity of educational content
• Added 9 new languages: Portuguese (Brazil), Spanish (Latin America), German, French, Polish, Ukrainian, Korean, Japanese, and Simplified Chinese
• A brief Unity logo now appears at startup — we've moved to Unity's free tier. This helps us reduce development costs.
• New app icon & name 1.12.0 12/09/2025 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. 1.11.0 08/15/2024 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.10.7 05/14/2024 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. 1.10.6 05/07/2024 The presentations for Depth-First Search (DFS) and Breadth-First Search (BFS) graph traversal algorithms have been redesigned to enhance the learning experience. 1.10.5 03/31/2024 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. 1.10.4 03/11/2024 Small UI Bug Fix 1.10.3 02/29/2024 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. 1.10.2 02/28/2024 We've updated the Home screen with a new look and feel to enhance your experience right from the start. 1.10.1 02/24/2024 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. 1.10.0 02/11/2024 Fixed an issue affecting some users where the app might not unlock after purchase. 1.9.2 09/27/2023 You can now select a theme for the code, tailoring the appearance to your individual preference. 1.9.1 09/10/2023 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.9.0 06/29/2023 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.8.0 05/24/2023 1. Stack
2. DFS and BFS (simplified versions) have been removed from the "Graph Algorithms" section due to their redundancy
3. New Syntax Highlight 1.7.0 03/17/2023 Bug fixing related to purchase status 1.6.1 01/16/2023 1. Array 
2. Linked list 1.6.0 01/16/2023 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.5.0 04/04/2022 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 1.4.0 08/01/2021 Minimum Spanning Tree 1.3.0 06/03/2021 Dijkstra'a algorithm 1.2.0 05/03/2021

Haftungsausschluss


Offizieller App Store-Link


Wir hosten VisiGrab: Algorithms & DSA nicht auf unseren Servern. Wir haben es nicht auf Viren, Adware, Spyware oder andere Arten von Malware gescannt. Diese App wird von Apple gehostet und hat deren Allgemeine Geschäftsbedingungen erfüllt, um dort gelistet zu werden. Wir empfehlen Vorsicht bei der Installation.

Der App-Store-Link für VisiGrab: Algorithms & DSA wird Ihnen von apps112.com ohne jegliche Zusicherungen, Gewährleistungen oder Garantien zur Verfügung gestellt, greifen Sie daher auf eigene Gefahr darauf zu.

Bei Fragen zu dieser speziellen App wenden Sie sich bitte direkt an den Herausgeber. Bei Fragen zu den Funktionalitäten von apps112.com kontaktieren Sie uns.





Klicken Sie auf Sterne, um diese APP zu bewerten!

Nutzerbewertung:
  0.0/5     0
Downloads: 0
Aktualisiert am: 2026-11-04
Herausgeber: Ievgen Ovsii
Betriebssystem: iOS
Lizenztyp: Free

TOP-DOWNLOADS
letzte Woche in Bildung & Erziehung