Data Structure Display 4+

Name: Data Structure Display
Rating: 4.1 (30 reviews)
Author: Jinan Matrix Information Technology Co., Ltd.

Jinan Matrix Information Technology Co., Ltd.

- 4.1 • 30개의 평가

- 무료
- 앱 내 구입 제공

설명

A novel data structure learning app, the most significant feature is that you can dynamically debug the data structure in this app, and visually observe the changes in the data structure during the operation. In this app you can learn the following data structures:

1. Linear structures, including arrays, linked lists, queues, stacks. Linear structures are the basis for other advanced data structures, as fine as advanced algorithms.

2. Tree structures, including binary tree, binary search tree, AVL tree, red-black tree, and heap. In this app, you can dynamically debug three traversals of the binary tree (including non-recursive traversal implementations), searching in the tree, balance adjustments in the AVL tree and red-black tree, and heap sorting. Give you the ability of handwritten red-black trees.

3. Graph structure, including the adjacency list storage representation of the graph structure, depth-first search and breadth-first search, finding the Euler path in the graph, topological sorting, maximum connected components, minimum spanning tree problem, and shortest single source Path problem. It also provides dynamic debugging of these classic graph algorithms.

4. The data structure introductory class will talk about the problem of the Tower of Hanoi. The algorithm that solves this problem is often recursive. This app provides dynamic debugging of the Tower of Hanoi problem, so you can no longer be confused about the recursive calls of the Tower of Hanoi.

4.1/5

30개의 평가

Wish it had dark mode

On ios im able to make a singular app dark mode via "smart invert", but not on macOS

Really bad

$2.99 for bad info. One sample problem had the answer start with “A circle of 30 people in the prompt inspired us to use a circular linked list”. For this particular problem a candidate using a simple array would be just ok, but a linked list, and particularly a circular linked list would not pass on this. Outside of data structures, a single 32-bit int could pass for tracking 30 people, but reality is that all you need is a single byte to track the positions that you do/don’t want in the answer and a count of people considered so far. Perhaps if other info was better I’d give a better rating, but I’m not paying $3 to find out that I’ve been robbed.

Run ads if you need to

If you need revenue, run ads. Don’t lock almost all the structures and ask for 2.99 when we can just google and get the same information for free. This is a pointless app if you require payment to see a simple stack or queue overview.