https://github.com/louis3112/sorting_searching_cardgame
One of my project for Data Structure in 2nd Semester. A simple sorting and searching number with various type of algorithms
https://github.com/louis3112/sorting_searching_cardgame
cli college-project searching-algorithms simple-project sorting-algorithms
Last synced: 2 months ago
JSON representation
One of my project for Data Structure in 2nd Semester. A simple sorting and searching number with various type of algorithms
- Host: GitHub
- URL: https://github.com/louis3112/sorting_searching_cardgame
- Owner: Louis3112
- Created: 2025-01-14T06:00:17.000Z (5 months ago)
- Default Branch: main
- Last Pushed: 2025-01-17T06:00:18.000Z (5 months ago)
- Last Synced: 2025-01-27T18:05:30.949Z (4 months ago)
- Topics: cli, college-project, searching-algorithms, simple-project, sorting-algorithms
- Language: C++
- Homepage:
- Size: 510 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# :bangbang: **Data Structure Project for 2nd Semester** :bangbang:
## :child: :card_index: **sorting_searching_cardgame** :child: :card_index:
One of my project for Data Structure 2nd Semester. The project is a simple sorting and searching cardgame app using various type of algorithms.Robofight Card (fictional) has 3 information : Card code, Power, HP.

User can sort the card by using 6 ways
1. Sorting based on Card Code (ascending)________ *(Bubble Sort)*
2. Sorting based on Card Code (descending)______ *(Insertion Sort)*
3. Sorting based on Power (ascending)____________ *(Selection Sort)*
4. Sorting based on Power (descending)__________ *(Merge Sort)*
5. Sorting based on HP (ascending)_______________ *(Quick Sort)*
6. Sorting based on HP (descending)______________ *(Heap Sort)*And
Search the card by using 3 ways
1. Finding based on Card Code___________________ *(Sequential Search)*
2. Finding based on Power________________________ *(Binary Search) (Sorted first by bubble sort)*
3. Finding based on HP____________________________ *(Interpolation Search) (Sorted first by bubble sort)*The project is developed using Functional programming, C++ language, runs on CLI, and only requires minimum of libraries (iostream and cmath).
There is a [report](https://github.com/user-attachments/files/18406932/085_TI2023C_Tugas.Sorting.docx)
written in *Bahasa Indonesia* that you can read from.## :arrow_forward: **Installation and Usage**
To install this project, please proceed these steps:
1. Clone the repository: **`git clone https://github.com/Louis3112/sorting_searching_cardgame`**
2. Navigate to the project directory: **`cd sorting_searching_cardgame`**
3. Compile the project: **`g++ -o sorting_searching_cardgame sorting_searching_cardgame.cpp`**
4. Run the project : **`./sorting_searching_cardgame`** (or just simply run with your IDE)## :bust_in_silhouette: **Contributing** :bust_in_silhouette:
If you'd like to contribute or upgrade the project, it would be my pleasure! :smile:
(I would be surprise tho, i mean.. it's a simple project)Here's how to to contribute:
1. Fork the repository
2. Create a new branch: **`git checkout -b your-branch-name`**
3. Make your changes
4. Commit your changes: **`git commit -m "your messages"`**
5. Push your changes to your forked repository: **`git push origin your-branch-name`**
6. Submit a pull request## :telephone_receiver: **Contact** :telephone_receiver:
If you have any questions or comments about this project, please contact **[me]([email protected])**