👋 Hi there! I'm a tech enthusiast with a Bachelor of Technology (B.Tech) in Computer Science from Amrita Vishwa Vidyapeetham. I'm passionate about leveraging technology to innovate and tackle complex challenges.
🎓 Currently, I'm taking on a new academic adventure as an upcoming Master in Management (MiM) - Grande Ecole student at ESSEC Business School. I'm excited to dive into the dynamic intersection of technology and business.
🚀 I love contributing my skills and knowledge to drive positive change in the world. Whether it's through coding, collaboration, or innovative projects, I'm always eager to explore new opportunities.
🌍 Let's connect and collaborate on GitHub! Together, we can build amazing things and make a difference.
Is your feature request related to a problem? Please describe.
A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]
Describe the solution you'd like
A clear and concise description of what you want to happen.
Describe alternatives you've considered
A clear and concise description of any alternative solutions or features you've considered.
Additional context
Add any other context or screenshots about the feature request here.
As of now, the filenames are not aligning to a particular pattern or notation or convention
Algorithm files across a category should be same so that it helps in documentation
For the long term, to have easy maintenance, we should declare a standard convention for naming files/folders and ask the community to adhere to it while making contributions
This preserves the symmetry among files and helps in easy maintenance
Hello , I'm a SWOC contributor . I would like to create a new issue .
The Floyd-Warshall algorithm is also known as All pairs shortest path algorithm is used to find all pair shortest path problem from a given weighted graph.
In the end it will generate a matrix, which will represent the minimum distance from any node to all other nodes in the graph.
The time complexity for this algorithm is O(V*3) --> Here V represents the number of vertices in the given graph .
I will provide the C program (explicit) for the above algorithm . The output not only consists of the result but also the step by step solution .
QuickSort is a Divide and Conquer algorithm.
It picks an element as pivot and partitions the given array around the picked pivot(in case of lomuto partition).
There are many different versions of quickSort that pick pivot in different ways:-
Is your feature request related to a problem? Please describe.
A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]
Describe the solution you'd like
A clear and concise description of what you want to happen.
Describe alternatives you've considered
A clear and concise description of any alternative solutions or features you've considered.
Additional context
Add any other context or screenshots about the feature request here.
Rabin-Karp algorithm is an algorithm used for searching/matching patterns in the text using a hash function. Unlike Naive string matching algorithm, it does not travel through every character in the initial phase rather it filters the characters that do not match and then performs the comparison.
This algorithm is available in the following language:
Counting sort is a sorting technique based on keys between a specific range. It works by counting the number of objects having distinct key values (kind of hashing). Then doing some arithmetic to calculate the position of each object in the output sequence.
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent