hacktoberfest2k20/datastructures-and-algorithms

Structure the Data in a correct and efficient way :fire:

DataStructures-and-Algorithms

Structure the Data in a correct and efficient way!

This repository will contain all the generic data-structure and algorithms that run in an effiecient time and space complexity. You may get your changes merged here by submitting a Pull Request 🔥

Q. How will I get my changes merged(how should I open a pull request)

A. You may propose your changes via a Pull Request. For how to open a pull request, give this a read, if stuck, please ping anyone of the maintainers for help.

Q. How should I begin contributing here?

A. Well, it is simple enough,follow the procedure

• Read the repository,
• Find the algorithm that you think is missing.
• Now create and issue in this repository via clicking here,
• Get yourself assigned to it(via commenting on the issue and tagging any of the maintainer)
• Implement it, and create a pull request, we'll merge your PR very soon with minimal changes needed.

For Contributions

• In the Pull Requests proposed, please add the Name Of Algorithm you added in the PR and its Space & Time Complexity both right at the top of the File you create/optimize.

• Don't Create duplicate issues or Pull Requests (ones which already exist on the repository)

• Star ⭐ the repo for exciting contests and updates!!!

More excited? Join our discord server and ask questions in the #hacktoberfest.

Fun Fact: This repository is independent of languages, which means, you may add the algorithm(s) in the programming language you find yourself comfortable with!

Very soon you'll be getting 'em merged in our Prime branch

datastructures-and-algorithms's Issues

Modularize files into Topics

Separate the Algorithms and Data Structures into categories for ease of access.

Heap sort

I would like to add heap sort algorithm along with it's time complexity.

Bucket Sort Algorithm in C++

Sorting an array of numbers using Bucket Sort technique.

Selection Sort Algorithm in C++

I want to work on Selection Sort in C++.
Please assign it to me.

Dijkstra's Algorithm

I would like to work on Dijkstra's algorithm.Please assign it to me

Linear search

As linear search is basic algorithm and not present in the repo , it should be added

Convex Hull: Graham's Scan Algorithm

Implementation of Graham's Scan algorithm to finding the convex hull of a finite set.

Merge Sort Using CPP

Tree Traversal

*PreOrder
*Inorder
*PostOrder

Implement minimum-cost spanning Tree using Kruskal Algoritm.

Can I take this @mayank64ce

docs: Code of Conduct Required

The repository lacks a code of conduct for tickets and PRs which may lead to compromise with the quality of the PRs.

Exponential Search Needed

Exponential search involves two steps:

1. Find the range where the element is present
2. Do Binary Search in above-found range.

Prime Factorization Algorithm

Many number theory problems can be solved by observing the prime factorization of input.

Segment tree for updating and finding min-max in given Range in an array.

Can I take this @mayank64ce

Fractional Knapsack | C++

Fractional Knapsack Problem -

Added Solution for the Fractional Knapsack Problem

Type of Issue -

• Adding New Code
• Improving Documentation

Programming Language

• C++

Added Counting Sort.cpp

Please assign this to me @AdarshSR28 , @s-ayush2903 .
I am new to open source contributions.
I have opened a PR for this #45
Thank You.

Dijkstra's Algorithm in C++

This is in reference to Dijkstra's Algorithm

Implementation of balanced bracket sequence checker (An interview favorite).

Checking if a bracket sequence is balanced is frequently asked in coding interviews.

add the list of implemented algorithms to readme file

So newbies get to know which algorithms are implemented, which helps them to remove the duplicate algorithm selections.

Happy Hacking!!!

Implement Depth First Search

Implement Depth First Search in a graph, using recursive approach.

Bubble Sort Algorithm in CPP

I want to work on this algorithm. Please assign it to me.

Binary Search using recursion in C++

The 3Sum problem is a popular coding problem.

This problem has been asked in various coding interviews.

Quick Sort Algorithm in C++

Recursive Quick Sort Algorithm. (Divide and Conquer Algorithm to sort a given array)

Insertion Sort

I am going to add the Graph Traversal Algorithm.

Graphs Cycle Detection Algorithm

Kadane's Algorithm in C

A C++ program to find the largest sum contiguous subarray from an array of integers

Graph Traversal algorithms in cpp

Square Root Decomposition

Implementation for Square Root Decomposition Technique to optimize Range Based Queries.

Bubble Sort in java

iam going to add bubble sort in java

Spelling mistake in README.md

I would like to work on this.

Binary Search (Iterative version)

Some people find iterative version more intuitive.

MST Algorithms in C++

Code for Prims's Algorithm and Kruskal's Algorithm.

Ackermann function

I want to work on this issue in c++,Please assign it to me

Code For Hashing needed

In a hash table, data is stored in an array format, where each data value has its own unique index value. Access of data becomes very fast if we know the index of the desired data.

sieve of eratosthenes

sieve of erathoness

bfs

To implement breadth first search in a graph

Lee's Algorithm for Shortest Path in a Maze made by a 2D Binary Array

I am self-assigning this issue since it has not been brought up until now!

Implement the KMP(Knuth–Morris–Pratt ) pattern searching algorithm

Inverse modulo(prime modulus)

create a function to calculate the inverse modulo where the exponent is prime.

Calculating greatest common divisor of two numbers in optimised way.

@s-ayush2903 please assign this to me.

Longest Common Subsequence

Add Longest Common Subsequence for given two strings

Tower of Hanoi

Implement the tower of Hanoi problem

Insertion Sort

I would like to add the algorithm for insertion sort in C++

Make separate directories For Languages

Hi, I would like to clean up this repo by making directories for languages and also add algorithms in Python

Segment Tree For updating queries and finding sum in a range

logarithmic power function

create a power function in log(n) time.

Travelling salesman problem

Implement the famous travelling salesman problem of graphs

Merge Sort

Dijkstra's Algorithm

/Given an undirected, connected and weighted graph G(V, E) with V number of vertices (which are numbered from 0 to V-1) and E number of edges. Find and print the shortest distance from the source vertex (i.e. Vertex 0) to all other vertices (including source vertex also) using Dijkstra's Algorithm. Print the ith vertex number and the distance from source in one line separated by space. Print different vertices in different lines./

#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll max(ll a, ll b)
{
if (a < b)
return b;
return a;
}

ll min(ll a, ll b)
{
if (a < b)
return a;
return b;
}

#define pp pair<int, int>
#define vpp vector
#define vecto vector
#define ss second
#define ff first
#define pb push_back
#define mp make_pair
using namespace std;

#define IOS
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0)

#define ull unsigned long long int
#define f(i, n) for (int i = 0; i < n; i++)
#define rep(i, a, b) for (int i = a; i < b; i++)

// Find the index with minimum weight which is not visited
ll findMinInd(ll n, bool visited[], ll weight[])
{
ll mini = INT_MAX, index = -1;
for (int i = 0; i < n; i++)
{
if (mini > weight[i] && visited[i] == false)
{
mini = weight[i];
index = i;
}
}

return index;

}

void solve()
{
bool visited[100000];
ll weight[100000];
memset(visited, false, sizeof(visited));

// INPUT
ll v, e;
cin >> v >> e;

ll **arr = new ll*[v];
for(int i=0;i<v;i++)
{
    arr[i] = new ll[v];
    for(int j=0;j<v;j++)
    {
        arr[i][j] = 0;
    }
}

for (int i = 0; i < v; i++)
{
    weight[i] = INT_MAX;
}
for (int i = 0; i < e; i++)
{
    ll a, b, c;
    cin >> a >> b >> c;

    arr[a][b] = c;
    arr[b][a] = c;
}

weight[0] = 0;
ll ans[v];

while (1)
{
    ll index = findMinInd(v, visited, weight);

    if (index == -1)
        break;

    visited[index] = true;
    ans[index] = weight[index] ;

    for (int i = 0; i < v; i++)
    {
        if (weight[i] > weight[index] + arr[index][i] && !visited[i] && arr[index][i] != 0)
        {
            weight[i] = weight[index] + arr[index][i];
        }
    }
}

// OUTPUT
for(int i=0;i<v;i++)
{
cout<<i<<" "<<ans[i]<<"\n";
}
}

int main()
{
IOS;
solve();
}