Skip to content

elitekbtu/ads_materials

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

32 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Algorithms and Data Structures

Welcome to the Algorithms and Data Structures repository! This repository contains implementations of various algorithms and data structures commonly used in computer science and software engineering.

Table of Contents

Introduction

This repository is a collection of algorithms and data structures implemented in different programming languages. It is designed for:

  • Students learning algorithms and data structures.
  • Developers preparing for coding interviews.
  • Enthusiasts looking to improve problem-solving skills.

Features

  • Clear and well-commented code for ease of understanding.
  • Multiple languages support (e.g., C++, Python, Java).
  • Algorithms categorized by type (e.g., sorting, searching, graph algorithms).
  • Standard data structures implemented with examples.

Algorithms

Sorting Algorithms

  • Merge Sort
  • Quick Sort
  • Heap Sort

Searching Algorithms

  • Binary Search
  • Depth-First Search (DFS)
  • Breadth-First Search (BFS)

Graph Algorithms

  • Dijkstra's Algorithm
  • Prim's Algorithm
  • Bellman-Ford Algorithm

Other Algorithms

  • Dynamic Programming
    • Fibonacci Sequence
    • Longest Common Subsequence
  • Greedy Algorithms

Data Structures

  • Arrays
  • Linked Lists
    • Singly Linked List
    • Doubly Linked List
  • Stacks and Queues
  • Trees
    • Binary Search Tree
    • Heap
  • Graphs
    • Adjacency List
    • Adjacency Matrix

How to Use

  1. Clone the repository:

    git clone https://github.com/elitekbtu/ads_materials.git
  2. Navigate to the desired folder to explore the implementation.

  3. Compile and run the code using your preferred compiler or interpreter.

    Example for C++:

    g++ filename.cpp -o output
    ./output

Contributing

Contributions are welcome! If you want to add an algorithm, improve existing code, or fix issues:

  1. Fork the repository.

  2. Create a new branch:

    git checkout -b feature-name
  3. Commit your changes and push the branch:

    git commit -m "Description of changes"
    git push origin feature-name
  4. Open a pull request.

License

This repository is licensed under the MIT License. See the LICENSE file for details.


Happy Coding! 🎉

About

No description, website, or topics provided.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published