Skip to content

All Linear and non linear data structures with sorting problem sets

Notifications You must be signed in to change notification settings

YuweAEC/data-structures-and-algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

50 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Data Structures and Algorithms

Title

Problem Solving with Data Structures

Introduction

DSA (Data Structures and Algorithms), also known as PSDS (Problem Solving Data Structures), is essential for writing efficient code. It involves organizing and managing data to solve complex problems effectively. This repository focuses on both linear and non-linear data structures to enhance problem-solving skills.

Linear Data Structures

Linear data structures store elements sequentially, facilitating easy traversal. Examples include:

  • Arrays: Elements stored in contiguous memory locations.
  • Linked Lists: Nodes containing elements and references to the next node.

Non-Linear Data Structures

Non-linear data structures offer more complex arrangements, making traversal more challenging. These structures include trees, graphs, and hash tables.

Sorting is crucial for arranging data in preferred orders, facilitating efficient searching and retrieval.

Authors

  • Yuvraj Singh
  • Gaurav Singh

Acknowledgements

  • Gaurav Singh

This README provides a comprehensive overview of data structures, emphasizing the importance of problem-solving skills and efficient coding practices.

Releases

No releases published

Packages

No packages published

Languages