Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/m0saan/structures

this repository contains a simple implementation to the most famous and useful data structures involving linear and non-linear ones
https://github.com/m0saan/structures

cpp-data-structures cpp11 cpp14 data-structures go go-algorithms go-datastructure golang linear-data-structures non-linear-data

Last synced: 13 days ago
JSON representation

this repository contains a simple implementation to the most famous and useful data structures involving linear and non-linear ones

Host: GitHub
URL: https://github.com/m0saan/structures
Owner: m0saan
Created: 2020-09-14T12:56:02.000Z (over 4 years ago)
Default Branch: master
Last Pushed: 2022-02-06T21:36:12.000Z (almost 3 years ago)
Last Synced: 2024-11-16T05:27:29.458Z (2 months ago)
Topics: cpp-data-structures, cpp11, cpp14, data-structures, go, go-algorithms, go-datastructure, golang, linear-data-structures, non-linear-data
Language: C++
Homepage:
Size: 11 MB
Stars: 4
Watchers: 1
Forks: 0
Open Issues: 0
Metadata Files:
- Readme: README.md

Awesome Lists containing this project

README

        # Data Structures

## 1. Description

This repository contains a simple implementation to linear and non linear data structures as well as to some of their algorithms.

There are basically two implementations **Go** and **C++**

### 2. Goal

1. (classical data structures implementations)

2. (based on MacOS Catalina/gcc)

3. (ease of use, one or at most two header files per ds)

### 3. What is a Data Structure

A **data structure** is a data organization, management and storage format that enables efficient access and modification   

### 4. What is an Algorithm

An **Algorithm** basically is a **sequence of instructions**, typically to solve a class of problems or perform a computation.    

### 5. What is Big O notation

 **Big O notation** is a way used to give the **efficiency of an algorithm**, more precisely, It tells us the **growth of an algorithm**

![alt text](https://github.com/M0-san/Data__Structures/blob/master/img/Big-O-Notation-Cheat-Sheet.png)

- **Constant**:       **O(1)**

- **Logarithmic**:    **O(Log(n)**

- **Linear**:         **O(n)**      

- **Quadratic**:      **O(n^2)** 

- **Exponential**:    **O(2^n)**

### 6. Linear Data Structures

* Arrays

* Linked Lists

* Stacks

* Queues

* Hash Tables (Map)

### 7. Non-Linear Data Structures

* Binary Trees

* AVL Tress

* Tries

* Heaps

* Graphs

* Undirected Graphs

### 8. Observations : 

[![forthebadge](https://forthebadge.com/images/badges/made-with-c-plus-plus.svg)](https://forthebadge.com)

[![forthebadge](https://forthebadge.com/images/badges/made-with-go.svg)

[![forthebadge](https://forthebadge.com/images/badges/open-source.svg)

[![forthebadge](https://forthebadge.com/images/badges/built-with-love.svg)](https://forthebadge.com)

need help:

[email protected]