 |
Data Structure Display |
|---|
| この情報はストアのものより古い可能性がございます。 | ||||
|
価格 | 無料 | ダウンロード |
|
|---|---|---|---|---|
| ｼﾞｬﾝﾙ | 教育 | |||
サイズ | 8.2MB | |||
| 開発者 | Jinan Matrix Information Technology Co., Ltd. | |||
| 順位 |
| |||
| ﾘﾘｰｽ日 | 2019-03-23 10:00:20 | 評価 |
|
|
| 互換性 | iOS 13.0以降が必要です。 iPhone、iPad および iPod touch 対応。 | |||
(3人)
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.
更新履歴
1. Stability improvements.
2. Imporve main UI style in iPadOS.
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.
更新履歴
1. Stability improvements.
2. Imporve main UI style in iPadOS.
ブログパーツ第二弾を公開しました！ホームページでアプリの順位・価格・周辺ランキングをご紹介頂けます。
ブログパーツ第2弾！
アプリの周辺ランキングを表示するブログパーツです。価格・順位共に自動で最新情報に更新されるのでアプリの状態チェックにも最適です。
ランキング圏外の場合でも周辺ランキングの代わりに説明文を表示にするので安心です。
サンプルが気に入りましたら、下に表示されたHTMLタグをそのままページに貼り付けることでご利用頂けます。ただし、一般公開されているページでご使用頂かないと表示されませんのでご注意ください。
幅200px版
幅320px版
お気に入りのアプリをご紹介頂くためのブログパーツです。アプリの価格や順位表示は毎日自動更新♪
サンプルが気に入りましたら、下に表示されたHTMLタグをそのままページに貼り付けることでご利用頂けます。
※配信を停止させていただく可能性もございますので、タグの改変はご遠慮ください。
Now Loading...
「iPhone & iPad アプリランキング」は、最新かつ詳細なアプリ情報をご紹介しているサイトです。
お探しのアプリに出会えるように様々な切り口でページをご用意しております。
「メニュー」よりぜひアプリ探しにお役立て下さい。
Presents by $$308413110 スマホからのアクセスにはQRコードをご活用ください。 →
Now loading...