Skip to content

Files

Latest commit

 

History

History
 
 

C

Folders and files

NameName
Last commit message
Last commit date
0-1_knapsack.c
0-1_knapsack.c
 
 
AP.c
AP.c
 
 
AVL_Tree.c
AVL_Tree.c
 
 
AnagramString.c
AnagramString.c
 
 
Armstrong.c
Armstrong.c
 
 
Bellman-Ford's_algorithm.c
Bellman-Ford's_algorithm.c
 
 
Binary_Search.c
Binary_Search.c
 
 
C_STACK.C
C_STACK.C
 
 
Check_balanced_paranthesis.c
Check_balanced_paranthesis.c
 
 
DutchFlag.c
DutchFlag.c
 
 
Euclid_GCD.c
Euclid_GCD.c
 
 
Linear_Search.c
Linear_Search.c
 
 
Longest_Common_Subsequence.c
Longest_Common_Subsequence.c
 
 
Maximum_Number.c
Maximum_Number.c
 
 
Maze_Problem.c
Maze_Problem.c
 
 
Mean_Median_Calculation.c
Mean_Median_Calculation.c
 
 
Merge_Sort.c
Merge_Sort.c
 
 
Mergesort.c
Mergesort.c
 
 
MinDenominations_GreedyAlgo.c
MinDenominations_GreedyAlgo.c
 
 
Muskan Gupta(interpolation search).cpp
Muskan Gupta(interpolation search).cpp
 
 
NthTermGP.c
NthTermGP.c
 
 
Palindrome_substring.c
Palindrome_substring.c
 
 
Permutations_And_Combinations.c
Permutations_And_Combinations.c
 
 
Priority based Scheduling (Non - Preemptive).c
Priority based Scheduling (Non - Preemptive).c
 
 
Quick_Sort.c
Quick_Sort.c
 
 
README.md
README.md
 
 
Radix_Sort.c
Radix_Sort.c
 
 
RotateArrayClockwise.c
RotateArrayClockwise.c
 
 
Search_in_Row_And_Column_Wise_Sorted_Matrix.c
Search_in_Row_And_Column_Wise_Sorted_Matrix.c
 
 
Selection_Sort_C.c
Selection_Sort_C.c
 
 
Shortest Job First Scheduling Algorithm (SJF - Non-Preemptive).c
Shortest Job First Scheduling Algorithm (SJF - Non-Preemptive).c
 
 
Sieve_of_Eratosthenes.c
Sieve_of_Eratosthenes.c
 
 
SinglyLL.c
SinglyLL.c
 
 
String_Palindrome.c
String_Palindrome.c
 
 
SwappingNumber.c
SwappingNumber.c
 
 
Ternary Search in C.c
Ternary Search in C.c
 
 
Tree_Inorder_Traversal.c
Tree_Inorder_Traversal.c
 
 
TwoPointer_to_find_sum_pairs.c
TwoPointer_to_find_sum_pairs.c
 
 
automorphic.c
automorphic.c
 
 
btheight.c
btheight.c
 
 
bubblesort.c
bubblesort.c
 
 
circularDLL.C
circularDLL.C
 
 
circularSLL.C
circularSLL.C
 
 
fcfs.c
fcfs.c
 
 
fizzbuzz.c
fizzbuzz.c
 
 
floyd-warshall.c
floyd-warshall.c
 
 
floyd_warshal.c
floyd_warshal.c
 
 
heap_sort.c
heap_sort.c
 
 
kadaneMaxSumSubArray.c
kadaneMaxSumSubArray.c
 
 
kmp.c
kmp.c
 
 
kruskal.c
kruskal.c
 
 
longestLengthPathMatrix.c
longestLengthPathMatrix.c
 
 
majority.c
majority.c
 
 
manhattanDistance.c
manhattanDistance.c
 
 
middle.c
middle.c
 
 
nQueens.c
nQueens.c
 
 
neon_number.c
neon_number.c
 
 
postorder.c
postorder.c
 
 
powerset.c
powerset.c
 
 
prefixSum.c
prefixSum.c
 
 
primefactors.c
primefactors.c
 
 
quick sort in doubly linked list.c
quick sort in doubly linked list.c
 
 
remove_nth_node.c
remove_nth_node.c
 
 
rep.c
rep.c
 
 
reverse.c
reverse.c
 
 
rotatell.c
rotatell.c
 
 
sudoko.c
sudoko.c
 
 
sumofFibonacciSeries.c
sumofFibonacciSeries.c
 
 
tower_of_hanoi.c
tower_of_hanoi.c
 
 
twinPrime.C
twinPrime.C
 
 

README.md

Add links to your code in Alphabetical Order.

Format:

-[Program name](name of the file)

-Anagram of Strings

-Armstrong Number Checker

-AVL Tree

-Bellman-Ford's algo

-Binary Search

-Bubble Sort

-Check for balanced paranthesis expression

-Circular Doubly Linked List

-Circular Singly Linked List

-Dutch Flag

-FCFS

-Find nth term in an A.P.

-Find the middle element of linked list

-FizzBuzz

-Floyd Warshall algorithm

-Height of Binary Tree

-Implement bubblesort using c

-Implement Euclidean Algorithm to find greatest common divisor of 2 given numbers.

-Implement Swapping Numbers

-Implement 0/1 Knapsack using Dynamic Programming

-Inorder tree traversal

-Kadane's Algorithm For Getting Maximum Sub Array easy implementation using c

-KMP Algorithm

-Kruskal Algorithm

-Linear Search.

-Longest Common Subsequence

-Longest Length Path in Matrix

-Majority Element in O(1)

-Manhattan Distance

-Maximum digit using given numbers

-Maze Problem using Backtracking

-Mean Median Calculation

-Merge Sort

-Minimum number of denominations (Indian Currency) using Greedy algo approach

-Neon Number

-Nth Term of GP

-N Queens Puzzle

-Palindrome Substring

-Permutations and Combinations

-Postorder Tree Traversal

-Powerset of the given set

-Prefix Sum

-Prime Factors using seive of eratosthenes

-Quick Sort

-[Quick Sort on Doubly Linked List](quick sort in doubly linked list.c)

-Radix Sort

-Remove Nth node of Linked List

-Reverse a linked list

-Rotate Array Clockwise by k elements

-Rotate Linked List in Group of K

-Search in Row And Column Wise Sorted Matrix

-Search Repeating elements using Map/Hashmap

-Selection Sort

-Singly Linked List

-String Palindrome

-Sum of Fibonacci Series

-Twin Prime Numbers

-Tower of Hanoi

-[Ternary Search](Ternary Search in C.c)

-Two Pointer algorithm to find sum pairs

-Heap Sort

-Sieve Of Eratosthenes

-Stack Implementation

-Automorphic Number

-[Shortest Job First Scheduling Algorithm](Shortest Job First Scheduling Algorithm (SJF - Non-Preemptive).C)

-[Priority based Scheduling](Priority based Scheduling (Non - Preemptive).C)