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

https://github.com/bhartik021/data-structure-algorithm

An repository that contains all the Data Structures and Algorithms concepts and their implementation in several ways, programming questions and Interview questions. The main aim of this repository is to help students who are learning Data Structures and Algorithms or preparing for an interview.
https://github.com/bhartik021/data-structure-algorithm

algorithm algorithms algorithms-and-data-structures algorithms-datastructures array binary-search bit-magic bit-manipulation cpp cpp-stl data-structures data-structures-and-algorithms linear-search mathematics recursion searching searching-algorithms stl string tree

Last synced: about 1 month ago
JSON representation

An repository that contains all the Data Structures and Algorithms concepts and their implementation in several ways, programming questions and Interview questions. The main aim of this repository is to help students who are learning Data Structures and Algorithms or preparing for an interview.

Awesome Lists containing this project

README

        

# Data-Structure-Algorithm

### Data Structure
Data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently. A data structure is a special format for organizing and storing data. General data structure types include arrays, files, linked lists, stacks, queues, trees, graphs, and so on.

Depending on the organization of the elements, data structures are classified into types:

* Linear data structures: Elements are accessed in a sequential order but it is not compulsory to store all elements sequentially. Examples: linked lists, stacks, queues.
* Non-linear data structures: Elements of this data structure are stored/accessed in a non-linear order. Examples: Trees and graphs.

![DSA Post Designs (Community)](https://user-images.githubusercontent.com/75694208/179344389-49db3efd-eff9-4b7e-a957-6af928580365.png)


### Algorithm
An algorithm is the step-by-step unambiguous instructions to solve a given problem.

* In the traditional study of algorithms, there are two main criteria for judging the merits of algorithms:
* Correctness (does the algorithm give a solution to the problem in a finite number of steps?)
* Efficiency (how much resources (in terms of memory and time) does it take to execute.)


![DSA Post Designs (Community) (1)](https://user-images.githubusercontent.com/75694208/176632586-c7951101-c5a2-442c-8bbf-d6ec325f6d05.png)