Skip to content

Welcome to the world of Algorithms in C! This repository serves as a comprehensive collection of various essential algorithms, ranging from classic sorting techniques like Insertion Sort, Merge Sort, Quicksort, and Selection Sort, to advanced algorithms like N-Queens, Kruskal's Algorithm, SOS, Floyd-Warshall, Fractional Knapsack,(LCS).

Notifications You must be signed in to change notification settings

ChaitanyaK77/Algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Analysis of Algorithms

Welcome to the world of Algorithms in C! This repository serves as a comprehensive collection of various essential algorithms, ranging from classic sorting techniques like Insertion Sort, Merge Sort, Quicksort, and Selection Sort, to advanced algorithms like N-Queens, Kruskal's Algorithm, SOS, Floyd-Warshall, Fractional Knapsack,(LCS). Key Features:

Insertion Sort: Understand the basics of this simple sorting algorithm and its implementation in C.

Merge Sort: Dive into the world of divide-and-conquer with Merge Sort, grasping its efficient sorting mechanism.

Quicksort: Explore the power of the Quicksort algorithm, known for its efficiency and versatility, and its practical C implementation.

Selection Sort: Discover the Selection Sort algorithm, learn its selection process, and its coding implementation in C.

N-Queens Problem: Tackle the classic N-Queens problem, employing C programming skills to find solutions for various board sizes.

Kruskal's Algorithm Explore Kruskal's algorithm for finding the Minimum Spanning Tree in a graph, and see how C can be leveraged to achieve this.

SOS - Sum of Subsets: Master the SOS algorithm, an essential problem in computer science, and unleash its potential in C.

Floyd-Warshall Algorithm: Grasp the all-pairs shortest path problem with the Floyd-Warshall algorithm, and implement it using C.

Fractional Knapsack: Dive into fractional knapsack problems, understanding the greedy approach to optimize selections in C.

Longest Common Subsequence (LCS): Conquer the LCS problem using dynamic programming techniques in C, and find the longest subsequence of two sequences.

Contributions: Contributions to this repository are highly encouraged! Whether you are a beginner or an experienced programmer, you can contribute new algorithms, optimize existing code, or improve documentation to enrich the learning experience for others. By collaboratively mastering these fundamental algorithms, we can enhance our problem-solving skills and become more adept programmers.

So, let's embark on a journey of algorithms in C! Together, we can unlock the secrets of efficient problem-solving and build a strong foundation for tackling complex challenges in the world of programming.

Happy coding! 🚀

About

Welcome to the world of Algorithms in C! This repository serves as a comprehensive collection of various essential algorithms, ranging from classic sorting techniques like Insertion Sort, Merge Sort, Quicksort, and Selection Sort, to advanced algorithms like N-Queens, Kruskal's Algorithm, SOS, Floyd-Warshall, Fractional Knapsack,(LCS).

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages