DSA - GitLite

KO | EN

gitlite — search

#javascript #hacktoberfest #react #ai #llm #rust #java #awesome #cli #kubernetes #vue #security #ios #open-source

DSA

(★ 13)

Master repo regarding DSA related MicroBytes.

DSA 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

[![All Contributors](https://img.shields.io/badge/all_contributors-16-orange.svg?style=flat-square)](https://raw.githubusercontent.com/Crio-Bytes/DSA/main/)

<a href="CONTRIBUTING.md"><img alt="Contributions Welcome" src="https://img.shields.io/badge/contributions-welcome-brightgreen?style=for-the-badge&labelColor=black&logo=github"></a>

<a href="LICENSE"><img alt="GitHub License MIT" src="https://img.shields.io/github/license/Crio-Bytes/DSA?style=for-the-badge&labelColor=black&logo=github"></a>

<a href="https://twitter.com/crio_do"><img alt="Twitter Follow" src="https://img.shields.io/twitter/follow/crio_do?style=for-the-badge&color=09f&labelColor=black&logo=twitter&label=@crio_do"></a>

# Introduction

A **data structure** is a named location that can be used to store and organise **data**. And, an **algorithm** is a collection of steps to solve a particular problem. Learning **data structures and algorithms** allow us to write efficient and optimised computer programs.

### Background

In [computer science](https://en.wikipedia.org/wiki/Computer_science), a **data structure** is a data organisation, management, and storage format that enables [efficient](https://en.wikipedia.org/wiki/Algorithmic_efficiency) access and modification. More precisely, a data structure is a collection of [data values](https://en.wikipedia.org/wiki/Data), the relationships among them, and the functions or operations that can be applied to the data.

In [mathematics](https://en.wikipedia.org/wiki/Mathematics) and [computer science](https://en.wikipedia.org/wiki/Computer_science), an **algorithm** is a finite sequence of [well-defined](https://en.wikipedia.org/wiki/Well-defined), computer-implementable instructions, typically to solve a class of problems or to perform a computation. Algorithms are always [unambiguous](https://en.wikipedia.org/wiki/Unambiguous) and are used as specifications for performing [calculations](https://en.wikipedia.org/wiki/Calculation), [data processing](https://en.wikipedia.org/wiki/Data_processing), [automated reasoning](https://en.wikipedia.org/wiki/Automated_reasoning), and other tasks.

<div align = "center">
    <img src = "https://raw.githubusercontent.com/Crio-Bytes/Demo-Repo/master/Maintainer%20Resources/img/micro-bytes-header.png">
</div>

<hr />

<details>
  <summary><b>Getting started with DSA</b></summary>

```
  Getting started with DSA is an anthology of Data Structures and Algorithms in all 
  popular programming languages.Open and solve an issue(which can be raised by you 
  too) inside the microbyte to get started with your contibution by adding on new Data 
  Structurs/Algorithms to the microbyte.
  ```

</details>

&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;— Kevin Paulose ([**@Kevinpaulose05**](https://github.com/Kevinpaulose05))

<details>
  <summary><b>0-1 Knapsack</b></summary>

```
  0-1 Knapsack is a classic Dynamic Programming problem. If you haven't yet studied 
  DP do give it a shot. In this Mirco-Byte we will focus on how this concept can be 
  extended to solve other DP problems having similar patterns.
  ```

</details>

&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;— Sreejan Chaudhury ([**@Sreejan-22**](https://github.com/Sreejan-22))

<details>
  <summary><b>Array in Javascript</b></summary>

```
  Arrays are one of the most used data structures. You probably have used it a lot, 
  but are you aware of the runtimes many array operations? In this microbyte, we are 
  going deeper into the most common operations and their runtimes.
  ```

</details>

&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;— Divyansh Rastogi ([**@divyanshrastogi51**](https://github.com/divyanshrastogi51))

<details>
  <summary><b>BinaryTree_LevelOrderTraversal_Types</b></summary>

```
  Unlike arrays and linked lists which are linear data structures, binary tree is a 
  hierarchical data structure, that is, data in binary trees are stored in a 
  hierarchical fashion. It is similar to how we draw a family tree or represent the 
  different directories and files in the filesystem. In this MicroByte, we'll 
  understand Level Order Traversal in Binary Trees and the different kinds of 
  questions based on this concept. 
  ```

</details>

&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;— K Anjali Kamath ([**@Anjalikamath**](https://github.com/Anjalikamath))

<details>
  <summary><b>Kadane's Algorithm</b></summary>

```
  Kadane's algorithm works by maintaining the start position of a subarray and 
  repeatedly looking at the next element in the array and deciding to either. 
  Discarding the subarray and starting a new subarray after that element. Let's look 
  into it more properly by going through this MicroByte.
  ```

</details>

&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;— Jeevan Chandra Joshi ([**@G1Joshi**](https://github.com/G1Joshi))

<details>
  <summary><b>Sorting Algorithms</b></summary>

```
  This MicroByte is aimed to understanding different sorting algorithms, along with 
  their time and space complexity analysis.
  ```

</details>

&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;— Divya Chopra ([**@divya1509**](https://github.com/divya1509))

<details>
  <summary><b>string_search</b></summary>

```
  In this micro-byte, we will be going through the working of the two most famous 
  string matching algorithms: Rabin Karp and KMP string matching algorithm. The 
  speciality of both these algorithms is that they achieve linear time complexity for 
  average case, making them far more superior to naive string matching algorithm 
  which completes string matching in quadratic time for all cases.
  ```

</details>

&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;— Shubham Gupto ([**@IamShubhamGupto**](https://github.com/IamShubhamGupto))

## Contributors ✨

Thanks goes to these wonderful people ([emoji key](https://allcontributors.org/docs/en/emoji-key)):

<table>
  <tr>
    <td align="center"><a href="https://kevinpaulose05.github.io/"><img src="https://avatars3.githubusercontent.com/u/64629493?v=4" width="100px;" alt=""/><br /><sub><b>Kevin Paulose</b></sub></a><br /><a href="https://github.com/Crio-Bytes/DSA/commits?author=Kevinpaulose05" title="Code">💻</a> <a href="https://github.com/Crio-Bytes/DSA/commits?author=Kevinpaulose05" title="Documentation">📖</a> <a href="#ideas-Kevinpaulose05" title="Ideas, Planning, & Feedback">🤔</a> <a href="#content-Kevinpaulose05" title="Content">🖋</a> <a href="https://github.com/Crio-Bytes/DSA/pulls?q=is%3Apr+reviewed-by%3AKevinpaulose05" title="Reviewed Pull Requests">👀</a> <a href="#eventOrganizing-Kevinpaulose05" title="Event Organizing">📋</a></td>
    <td align="center"><a href="https://github.com/amoghrajesh"><img src="https://avatars2.githubusercontent.com/u/35884252?v=4" width="100px;" alt=""/><br /><sub><b>Amogh Rajesh Desai</b></sub></a><br /><a href="https://github.com/Crio-Bytes/DSA/pulls?q=is%3Apr+reviewed-by%3Aamoghrajesh" title="Reviewed Pull Requests">👀</a> <a href="#eventOrganizing-amoghrajesh" title="Event Organizing">📋</a></td>
    <td align="center"><a href="https://github.com/Anjalikamath"><img src="https://avatars3.githubusercontent.com/u/41792345?v=4" width="100px;" alt=""/><br /><sub><b>K Anjali Kamath</b></sub></a><br /><a href="https://github.com/Crio-Bytes/DSA/commits?author=Anjalikamath" title="Code">💻</a> <a href="https://github.com/Crio-Bytes/DSA/commits?author=Anjalikamath" title="Documentation">📖</a> <a href="#ideas-Anjalikamath" title="Ideas, Planning, & Feedback">🤔</a> <a href="#content-Anjalikamath" title="Content">🖋</a></td>
    <td align="center"><a href="https://www.youtube.com/channel/UC9eDh5ByrCT2WinIji5Qyig"><img src="https://avatars2.githubusercontent.com/u/62458868?v=4" width="100px;" alt=""/><br /><sub><b>Sudhanshu tiwari</b></sub></a><br /><a href="https://github.com/Crio-Bytes/DSA/pulls?q=is%3Apr+reviewed-by%3Asudhanshutiwari264" title="Reviewed Pull Requests">👀</a> <a href="#eventOrganizing-sudhanshutiwari264" title="Event Organizing">📋</a></td>
    <td align="center"><a href="https://www.divyanshrastogi.xyz/"><img src="https://avatars3.githubusercontent.com/u/54467001?v=4" width="100px;" alt=""/><br /><sub><b>Divyansh Rastogi</b></sub></a><br /><a href="https://github.com/Crio-Bytes/DSA/commits?author=divyanshrastogi51" title="Code">💻</a> <a href="https://github.com/Crio-Bytes/DSA/commits?author=divyanshrastogi51" title="Documentation">📖</a> <a href="#ideas-divyanshrastogi51" title="Ideas, Planning, & Feedback">🤔</a> <a href="#content-divyanshrastogi51" title="Content">🖋</a></td>
    <td align="center"><a href="https://crio.do/"><img src="https://avatars0.githubusercontent.com/u/51743602?v=4" width="100px;" alt=""/><br /><sub><b>Crio.Do</b></sub></a><br /><a href="#eventOrganizing-CrioDo" title="Event Organizing">📋</a></td>
    <td align="center"><a href="http://ak-shaw-portfolio.netlify.app"><img src="https://avatars0.githubusercontent.com/u/51538194?v=4" width="100px;" alt=""/><br /><sub><b>Ayush Kumar Shaw</b></sub></a><br /><a href="https://github.com/Crio-Bytes/DSA/commits?author=Ak-Shaw" title="Code">💻</a> <a href="https://github.com/Crio-Bytes/DSA/commits?author=Ak-Shaw" title="Documentation">📖</a> <a href="#eventOrganizing-Ak-Shaw" title="Event Organizing">📋</a> <a href="#ideas-Ak-Shaw" title="Ideas, Planning, & Feedback">🤔</a> <a href="#maintenance-Ak-Shaw" title="Maintenance">🚧</a> <a href="https://github.com/Crio-Bytes/DSA/pulls?q=is%3Apr+reviewed-by%3AAk-Shaw" title="Reviewed Pull Requests">👀</a></td>
  </tr>
  <tr>
    <td align="center"><a href="https://github.com/archithdwij"><img src="https://avatars1.githubusercontent.com/u/30730368?v=4" width="100px;" alt=""/><br /><sub><b>Archithdwij</b></sub></a><br /><a href="https://github.com/Crio-Bytes/DSA/pulls?q=is%3Apr+reviewed-by%3Aarchithdwij" title="Reviewed Pull Requests">👀</a> <a href="#eventOrganizing-archithdwij" title="Event Organizing">📋</a></td>
    <td align="center"><a href="https://github.com/DivyaSaravanan"><img src="https://avatars2.githubusercontent.com/u/42182403?v=4" width="100px;" alt=""/><br /><sub><b>Divya_S</b></sub></a><br /><a href="https://github.com/Crio-Bytes/DSA/commits?author=DivyaSaravanan" title="Code">💻</a> <a href="#content-DivyaSaravanan" title="Content">🖋</a></td>
    <td align="center"><a href="https://github.com/verma-pulkit"><img src="https://avatars2.githubusercontent.com/u/55025041?v=4" width="100px;" alt=""/><br /><sub><b>Pulkit Verma</b></sub></a><br /><a href="https://github.com/Crio-Bytes/DSA/commits?author=verma-pulkit" title="Code">💻</a> <a href="#content-verma-pulkit" title="Content">🖋</a></td>
    <td align="center"><a href="https://github.com/Sreejan-22"><img src="https://avatars3.githubusercontent.com/u/64251207?v=4" width="100px;" alt=""/><br /><sub><b>Sreejan-22</b></sub></a><br /><a href="https://github.com/Crio-Bytes/DSA/commits?author=Sreejan-22" title="Documentation">📖</a> <a href="https://github.com/Crio-Bytes/DSA/commits?author=Sreejan-22" title="Code">💻</a> <a href="#content-Sreejan-22" title="Content">🖋</a> <a href="#ideas-Sreejan-22" title="Ideas, Planning, & Feedback">🤔</a></td>
    <td align="center"><a href="https://github.com/IamShubhamGupto"><img src="https://avatars2.githubusercontent.com/u/32878682?v=4" width="100px;" alt=""/><br /><sub><b>Shubham</b></sub></a><br /><a href="https://github.com/Crio-Bytes/DSA/commits?author=IamShubhamGupto" title="Code">💻</a> <a href="#content-IamShubhamGupto" title="Content">🖋</a> <a href="#ideas-IamShubhamGupto" title="Ideas, Planning, & Feedback">🤔</a> <a href="https://github.com/Crio-Bytes/DSA/commits?author=IamShubhamGupto" title="Documentation">📖</a></td>
    <td align="center"><a href="https://github.com/Janhavi-Gautam"><img src="https://avatars2.githubusercontent.com/u/72925384?v=4" width="100px;" alt=""/><br /><sub><b>Janhavi Gautam</b></sub></a><br /><a href="https://github.com/Crio-Bytes/DSA/commits?author=Janhavi-Gautam" title="Code">💻</a></td>
    <td align="center"><a href="https://www.linkedin.com/in/G1Joshi"><img src="https://avatars2.githubusercontent.com/u/52780516?v=4" width="100px;" alt=""/><br /><sub><b>Jeevan Chandra Joshi</b></sub></a><br /><a href="https://github.com/Crio-Bytes/DSA/commits?author=G1Joshi" title="Code">💻</a> <a href="#content-G1Joshi" title="Content">🖋</a> <a href="#ideas-G1Joshi" title="Ideas, Planning, & Feedback">🤔</a> <a href="https://github.com/Crio-Bytes/DSA/commits?author=G1Joshi" title="Documentation">📖</a></td>
  </tr>
  <tr>
    <td align="center"><a href="https://github.com/TheShubham-K"><img src="https://avatars0.githubusercontent.com/u/52125841?v=4" width="100px;" alt=""/><br /><sub><b>Shubham Kumar</b></sub></a><br /><a href="https://github.com/Crio-Bytes/DSA/commits?author=TheShubham-K" title="Code">💻</a> <a href="#content-TheShubham-K" title="Content">🖋</a></td>
    <td align="center"><a href="https://github.com/divya1509"><img src="https://avatars3.githubusercontent.com/u/49750052?v=4" width="100px;" alt=""/><br /><sub><b>Divya</b></sub></a><br /><a href="https://github.com/Crio-Bytes/DSA/commits?author=divya1509" title="Code">💻</a> <a href="https://github.com/Crio-Bytes/DSA/commits?author=divya1509" title="Documentation">📖</a> <a href="#ideas-divya1509" title="Ideas, Planning, & Feedback">🤔</a> <a href="#content-divya1509" title="Content">🖋</a></td>
  </tr>
</table>

This project follows the [all-contributors](https://github.com/all-contributors/all-contributors) specification. Contributions of any kind welcome!