shree1999 / data-structures-and-algorithms Goto Github PK

C++ 100.00%

cpp data-structures algorithms-and-data-structures

data-structures-and-algorithms's Introduction

Data Structures and Algorithms

Welcome

Hello and welcome to an open souce project created by shree1999! This project is designed to help beginner computer science students a place to learn and practice data structures and algorithms common to computer science. The goal is for you to be able to learn the ins and outs of these structures to the point where you can use them in your own projects and problems. You will find that different structures work better for different kinds of data. Part of the hope with this is that you will begin to gain an understanding of when and where to use different structures. Let's get learning!

What's in this Project?

Data Structures:
- Arrays
- Graphs
- Hash Tables
- Linked Lists
- Queues
- Stacks
- Trees
Algorithms:
- Recursions
  - Factorial
  - Fibonacci
  - Reverse String
- Searching
  - Breadth First
  - Depth First
  - Dijkstra
  - Bellmann-Ford
  - Binary
  - Linear
- Sorting
  - Bubble
  - Heap
  - Insertion
  - Merge
  - Quick
  - Selection

All of these examples and problems presented are written in C/C++.

Getting Started

Don't know where to start? Right here is perfect! We will walk you through exactly how to get set up to work with these data structures and algorithms and solve the problems we have set up for you.

To get started, make a fork of this repository.
You will want to have an IDE to work in, Visual Studio or VS Code are typical for C/C++.
In your forked version, press the green code button. Copy the HTTPS link.
Open Visual Studio, select clone a repository
Paste the Link in "Repository Location", and select the destination you want your local copy stored in
Click clone and get started!

Contributions

This repository is open for contributions feel free to check the CONTRIBUTING.md file for details on how to add anything I missed

data-structures-and-algorithms's People

Contributors

Stargazers

Watchers

Forkers

bitquality manthanmkulakarni rhutomo shiva-krishna yulanl22 jamesjaj paramjeetdhiman tushar-sharma1 cloudhananim goutamiuppu mahmud-soft ai7pfru luiscarlosjunior eyohannesmason harish24ms eliyaaah pooja1198 renieph gbenamy i-prashanth-s gagan-jakhu khassenalisher punam-jasud allenabraham999 kush-daga skrk536 arunsinghsnd anujsoni08 sreenevaas weikongwei hoanf prajput35 baisilg hancovisagie jyotiradityasinghrathore santoshs0612 myhmeiyuanhuang omar-hosni justinjenish krimid chall88 utsavll0 minimayank gogi2712 mahathi1404 manevivek gurutu harshil-gupta ioabhishek om-mahawar bhaswatib saurav1423 rbnhd swapnilmall gaminee prasadm07 ayush-oberoi zitong-xu devlearning9874 manhalrahman utsukushiihime harshiiash derekrsargent satadalmazumdar untilhamza ny20 sunwoongc developer-hosny avina-jain amitbhalerao jigmetnamgyal cneal111 shadown sharmarajan fazalkhan14 corazhang saikrishnamasetti manjunathshiva ibrajber99 pshweta13 shadkhan37 k1ngalph0x sachin3973 velkur-bharath daniel-sogbey partofheartpri10 belide tushank-panchal ramanandkmr18 nagamruta nowshad7 moyise solaris1712 sbaah khansaleemahmed frt92 yaseenbabamohd harshchan eeshasrivastava ledieulinh96

data-structures-and-algorithms's Issues

Data Structures and Algorithms C/C++

Error in Data-Structures-and-Algorithms/blob/master/Arrays-Implementation/arrays/main.cpp

In Data-Structures-and-Algorithms/blob/master/Arrays-Implementation/arrays/main.cpp, the get method, I think that we should test index < totalNumbers rather than index < capacity. Here is a reference: https://www.geeksforgeeks.org/how-to-implement-our-own-vector-class-in-c/.

[LOGIC] - BST REMOVE NODE

In the below code snippet from BST under the `deleteNode` function. The logic is quite unclear for me like how it is working for the below case.

            Root
           /    \
     child1   child2
     /   \      
 Null   leaf1

Code Snippet

else if (temp->left == NULL || temp->right == NULL)
                {
                    cout << "We are deleting parent node which have one child" << endl;
                    if (temp->left != NULL)
                    {
                        parent->left = temp->left;
                    }
                    else
                    {
                        parent->right = temp->right;
                    }
                    free(temp);
                    return;
                }

If you can put light on it then it would be a great help :)

Add methods to access Linked List elements

Implement a get() method to access the element at a certain index of the Linked List and a find() method to search for an element with a specific value and return its index.

Delete Function [BST]

cout << "Deleting Node which has two children" << endl;
// in this case we need to find the pre-order successor.
Node *t = temp->right;
if (t->left == NULL && t->right == NULL)
{
    temp->data = t->data;
    temp->right = NULL;
    free(t);
    return;
}
else if (t->left == NULL && t->right != NULL)
{
    temp->data = t->data;
    temp->right = t->right;
    free(t);
    return;
}
while (t->left != NULL)
{
    parent = t;
    t = t->left;
}
temp->data = t->data;
parent->left = NULL;
free(t);
return;

In the above code snippet of the Delete function from BST. Please mention cases that we are handling.