KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#dsh #dsh-plugin #developer-tools #ai-agent #claude-code #codex #typescript #ai-agents #deepseek-harness #mcp #cli #rust

java-dsa-visualization

★ 7 Open GitHub ↗

visualize some algorithms with java-swing

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# JAVA DSA VISUALIZATION

## Contents

|    | Content                                                         | Status  |
|:--:|:----------------------------------------------------------------|:-------:|
| 1  | Sort Algorithm: Bubble Sort                                     | &#9745; |
| 2  | Sort Algorithm: Selection Sort                                  | &#9745; |
| 3  | Sort Algorithm: Insertion Sort                                  | &#9745; |
| 4  | Sort Algorithm: Quick Sort                                      | &#9745; |
| 5  | Sort Algorithm: Merge Sort                                      | &#9745; |
| 6  | Sort Algorithm: Heap Sort                                       | &#9745; |
| 7  | Search Algorithm: Sequential Search                             | &#9745; |
| 8  | Search Algorithm: Binary Search                                 | &#9745; |
| 9  | Data Structure: List - Array List                               | &#9745; |
| 10 | Data Structure: List - Singly Linked List                       | &#9745; |
| 11 | Data Structure: List - Double Linked List                       | &#9745; |
| 12 | Data Structure: Stack - Array Stack                             | &#9745; |
| 13 | Data Structure: Stack - Linked Stack                            | &#9745; |
| 14 | Data Structure: Queue - Array Queue                             | &#9745; |
| 15 | Data Structure: Queue - Linked Queue                            | &#9745; |
| 16 | Data Structure: Priority Queue - Unsorted Array Priority Queue  | &#9745; |
| 17 | Data Structure: Priority Queue - Sorted Array Priority Queue    | &#9745; |
| 18 | Data Structure: Priority Queue - Unsorted Linked Priority Queue | &#9745; |
| 19 | Data Structure: Priority Queue - Sorted Linked Priority Queue   | &#9745; |
| 20 | Data Structure: Priority Queue - Min Heap Priority Queue        | &#9745; |
| 21 | Data Structure: Tree - Binary Search Tree                       | &#9745; |
| 22 | Data Structure: Tree - AVL Tree                                 | &#9745; |

## Features

### 1. Sort Algorithms

#### 1.1. Sort algorithms

![Screenshot (417)](https://github.com/dangngocquan/java-algorithm-visualizer/assets/95365566/f87843ce-6975-4232-917c-642ddea90ba5)

Sort Algorithms will be executed on an array with 6 features:

- `Shuffle`: Shuffle position of elements in current array.
- `Generate New`: Generate new array, each element will have random value in range [1 - 99].
- `Array size`: The size of array. You can change this value in range [2 - 128].
- `Elements`: The elements in current array. You can custom set each element value in array with value in range [1 - 99].
- `Animation Speed`: Period of each animation step. You can set animation speed with min value is 10 (ms) (this is the fastest case).
- `Start sort | Pause sort | Continue sort`: You can start the sort animation, pause it or continue if you want.

#### 1.2. Search Algorithms

![Screenshot (418)](https://github.com/dangngocquan/java-algorithm-visualizer/assets/95365566/2e3f5398-3a52-4b07-a49c-3d1043b20e92)

Sort Algorithms will be executed on an array with 7 features:

- `Shuffle`: Shuffle position of elements in current array.
- `Generate New`: Generate new array, each element will have random value in range [1 - 99].
- `Array size`: The size of array. You can change this value in range [2 - 128].
- `Elements`: The elements in current array. You can custom set each element value in array with value in range [1 - 99].
- `Value searching`: The value which you want to search in current array. You can set this value in range [1- 99].
- `Animation Speed`: Period of each animation step. You can set animation speed with min value is 10 (ms) (this is the fastest case).
- `Start sort | Pause sort | Continue sort`: You can start the sort animation, pause it or continue if you want.

#### 1.3. Data Structures

![Screenshot (419)](https://github.com/dangngocquan/java-algorithm-visualizer/assets/95365566/0efd2edb-3bfd-4fc6-9770-9c5d8035c59a)

Data Structures will have 3 features:

- `Animation Speed`: Period of each animation step. You can set animation speed with min value is 500 (ms) (this is the fastest case).
- `Choose Action`: You can choose a method of current data structure which you want to see visualization
  - List: Have 5 actions `add(value)`, `add(index, value)`, `get(index)`, `remove(index)`, `remove(value)`
    
    ![Screenshot (420)](https://github.com/dangngocquan/java-algorithm-visualizer/assets/95365566/ec0d2e5d-82c5-4429-bc82-ed99ea273cbe)
    
  - Stack: Have 2 actions `push(value)`, `pop()`
    
    ![Screenshot (421)](https://github.com/dangngocquan/java-algorithm-visualizer/assets/95365566/b3f66804-553c-4496-a6d0-e0448b1376d5)

- Queue: Have 2 actions `enqueue(value)`, `dequeue()`
    
    ![Screenshot (422)](https://github.com/dangngocquan/java-algorithm-visualizer/assets/95365566/787e4eaf-6e83-4a8a-87c3-9d6e444957ea)

- Priority Queue: Have 2 actions `insert(key, value)`, `removeMin()`
    
    ![Screenshot (423)](https://github.com/dangngocquan/java-algorithm-visualizer/assets/95365566/1535bef6-4305-4082-a7fa-9f7f5fbff6e1)

- Tree: Have 8 actions includes `6 traversal methods`, `insert(value)`, `delete(value)`
    
    ![Screenshot (424)](https://github.com/dangngocquan/java-algorithm-visualizer/assets/95365566/248df529-28ba-4648-b1fd-e1cb1d01f6d7)

- `Run Action`: Run animation with selected method. When you started animation, you can't pause it.

## Demo

### 1. Sort Algorithm: Bubble Sort

https://github.com/dangngocquan/java-algorithm-visualizer/assets/95365566/c8d53ca7-8d10-4ea2-af04-a19d6af96339

### 2. Sort Algorithm: Selection Sort

https://github.com/dangngocquan/java-algorithm-visualizer/assets/95365566/b74e24d5-f76b-4f07-bb03-53aa4355ea46

### 3. Sort Algorithm: Insertion Sort

https://github.com/dangngocquan/java-algorithm-visualizer/assets/95365566/68aea0a2-7069-400b-b297-10046247ef91

### 4. Sort Algorithm: Quick Sort

https://github.com/dangngocquan/java-algorithm-visualizer/assets/95365566/00333228-3933-4621-96c0-b1e7e878b4ad

### 5. Sort Algorithm: Merge Sort

https://github.com/dangngocquan/java-algorithm-visualizer/assets/95365566/df9f5c78-9b8f-4976-8bc6-07670d41653f

### 6. Sort Algorithm: Heap Sort

https://github.com/dangngocquan/java-algorithm-visualizer/assets/95365566/338baa23-8376-41bb-bfee-581f38649c90

### 7. Search Algorithm: Sequential Search

https://github.com/dangngocquan/java-algorithm-visualizer/assets/95365566/9d0d01c6-94e7-4d92-b6b7-81075ebb9e8a

### 8. Search Algorithm: Binary Search

https://github.com/dangngocquan/java-algorithm-visualizer/assets/95365566/9679052a-a8d9-4b7a-a008-929767679164

### 9. Data Structures: List - Array List

#### 9.1. Method `add(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/3723c9ef-f08f-41fc-aa98-c6c9f258a84e

#### 9.2. Method `add(index, value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/afe77a6e-61a1-4b2b-9b88-523e8675d39b

#### 9.3. Method `get(index)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/febc53e7-ada1-4053-9826-5e93b91f5f2b

#### 9.4. Method `remove(index)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/3c36f27d-f670-48b8-a142-d980997d15c1

#### 9.5. Method `remove(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/1c05ad2c-0481-4420-8690-a72c1c20ce5d

### 10. Data Structures: List - Singly Linked List

#### 10.1. Method `add(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/4a32cf77-19c2-4c82-b592-5bd5ebe5b66e

#### 10.2. Method `add(index, value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/cb6be5b3-b12e-4daf-8f86-6f945df14c48

#### 10.3. Method `get(index)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/0a8ec2a9-40e6-4dc0-a89a-614c5c7a1342

#### 10.4. Method `remove(index)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/ccc1166c-0c06-418b-9ec8-72c8e7de2b86

#### 10.5. Method `remove(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/2328593a-c1a7-47bf-b1ad-85e679b5ef13

### 11. Data Structures: List - Double Linked List

#### 11.1. `add(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/aa4a19a5-fb51-46ee-bac5-1cd51f99b669

#### 11.2. `add(index, value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/d97ac1ca-e56a-4015-9afc-222c1cfb6ac1

#### 11.3. `get(index)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/a4fb5db3-226e-42fe-934d-a92154e0af70

#### 11.4. `remove(index)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/28c722e8-c7e0-4774-9793-96c8d1380a85

#### 11.5. `remove(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/ea6547fe-1d6c-4356-b259-fa31b16b3d89

### 12. Data Structures: Stack - Array Stack

#### 12.1. `push(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/bd9ff96d-d424-450c-8d4c-11c8669b8d08

#### 12.2. `pop()`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/24d877c7-d735-48e3-bcae-94fb02bf6da3

### 13. Data Structures: Stack - Linked Stack

#### 13.1. `push(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/3c34fd00-197a-47e7-aa4e-9861b23480cb

#### 13.2. `pop()`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/318d6896-fc1b-470f-87d0-56b1ed8da20c

### 14. Data Structures: Queue - Array Queue

#### 14.1. `enqueue(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/8180ff80-f45e-499c-b55b-1d889c7f0388

#### 14.2. `dequeue()`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/e07956de-9132-4cb6-9bae-6dc960b5aa95

### 15. Data Structures: Queue - Linked Queue

#### 15.1. `enqueue(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/bc68354a-6e77-408b-8f29-3397df843f86

#### 15.2. `dequeue()`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/c55784eb-8a4c-44a1-af9a-bee7c3d037b0

### 16. Data Structures: Priority Queue - Unsorted Array Priority Queue

#### 16.1. `insert(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/8adb74b2-6d98-445e-919b-c6d16383256b

#### 16.2. `removeMin()`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/da8b59a6-68a3-47b0-b54a-cf8ef7d5a380

### 17. Data Structures: Priority Queue - Sorted Array Priority Queue

#### 17.1. `insert(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/97772259-454f-4e93-b80f-f78c5e8f941a

#### 17.2. `removeMin()`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/1079bdae-2972-4164-918b-431555d8e1ac

### 18. Data Structures: Priority Queue - Unsorted Linked Priority Queue

#### 18.1. `insert(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/6d6d6737-5867-41b5-b53d-e1f57b78e255

#### 18.2. `removeMin()`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/cfc65097-7d3f-41b4-b3ac-50b251462013

### 19. Data Structures: Priority Queue - Sorted Linked Priority Queue

#### 19.1. `insert(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/d0a3269e-7843-40ce-81a8-23da11a703ea

#### 19.2. `removeMin()`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/6aff27f6-e849-40ee-bd74-308328725f47

### 20. Data Structures: Priority Queue - Min Heap Priority Queue

#### 20.1. `insert(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/a4ec6f90-d352-40ca-b900-99275f9e63d1

#### 20.2. `removeMin()`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/4fc130e5-6cf6-409b-97ba-6e6419e47be6

### 21. Data Structures: Tree - Binary Search Tree

#### 21.1. `traversals`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/98e5b273-be29-477b-a012-d8848337240f

#### 21.2. `insert(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/756dc752-831b-4b26-ae9d-91c9098a951d

#### 21.2. `delete(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/ef691bb5-1eb8-42b0-a2ee-09fcf6da32d4

### 22. Data Structures: Tree - AVL Tree

#### 22.1. `traversals`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/7e9c14be-2b14-4e07-9b74-2e83c768eb2d

#### 22.2. `insert(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/27664636-85e8-42e9-bf92-713221cb3ddb

#### 22.2. `delete(value)`

https://github.com/dangngocquan/java-dsa-visualization/assets/95365566/16eb1e4d-e2c6-49bf-8f2f-a19bf534a9f7

java-dsa-visualization

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README