https://github.com/raadiah/dsa-using-go
Implementing the most used data structures and algorithms using Go.
https://github.com/raadiah/dsa-using-go
algorithms algorithms-and-data-structures data-structures golang
Last synced: about 1 year ago
JSON representation
Implementing the most used data structures and algorithms using Go.
- Host: GitHub
- URL: https://github.com/raadiah/dsa-using-go
- Owner: Raadiah
- Created: 2025-01-16T05:27:10.000Z (about 1 year ago)
- Default Branch: main
- Last Pushed: 2025-01-16T06:35:04.000Z (about 1 year ago)
- Last Synced: 2025-01-16T06:45:55.668Z (about 1 year ago)
- Topics: algorithms, algorithms-and-data-structures, data-structures, golang
- Language: Go
- Homepage:
- Size: 4.88 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Implementation of Different Data Structures and Algorithms using Go
In this project, we will implement different Data Structures and Algorithms using Go. We will be using the ***Fundamentals of Computer Algorithms*** by *E. Horowitz et.al* as a reference book.
This will be a command line tool programming. Also, you can import packages to your project.
#### Import Package
To add the module into your package enter into your project directory terminal the following code:
```go get github.com/Raadiah/DSA-Using-Go@v0.5.0```
Then using the following imports you can import the respective packages
### Data Structures
#### [Stack](/stack/stack.md)
```import "github.com/Raadiah/DSA-Using-Go@v0.5.0/stack"```
Then any stack operations can be done.
- stack.GetArrayStack() - To create an array stack
- stack.GetLinkedListStack() - To create a linked list stack
From a stacker object created from the above methods, the following methods can be called:
- Top() - To get top element. Nil is returned if no top is set
- Delete() - Delete the top element. Returns true for deleted, false for empty stack
- Insert(item) - Insert element to the top