yashjain2 / algorithms Goto Github PK

1. Make a folder in algo -> Prim's
2. Put code inside the folder.
3. Comment the code for good readability.
4. Print the output at the code footer in comments

Given 2 sorted linked lists, merge the lists to a single sorted linked list.

Write a code to sort a given array using bubblesort :
Check the output for 1-D array in : {2,5,6,5,34,11,23,0,3}
Be sure your code must give appropriate output

Make a folder in algo -> Backtracking
Then make a program of n queen using Backtracking recursively.
Comment the code properly
And at last comment the output.

1. Write clean code with proper comments without plagiarism.
2. Print the output of your code at last in comment in your code.

Write a code to sort an array using insertion sorting

1. Wite clean code with proper comments
   2.Put the code output at last in your code with comments

1. Add a file in Sorting Folder -> Heap_Sort
2. Comment the code for good readability.
3. At last comment the output.

Write a code for dynamic programming matrix multiplication to identify minimum number of multiplications required to multiply n matrices.
Use recursive version

Write a code to find a peak in a 1-D and 2-D array implementation

1. Check the output for 1-D in : {2,5,6,5,34,11,23,0,3}
2. Check the output for 2-D in : {2,45,0}, {1,3,9}, {78,67,10}
   Here, in an array there must be multiple peaks but the output must print the first encountered peak while iterating

Write a code to sort a given array using selection sort :
Check the output for 1-D array in : {2,5,6,5,34,11,23,0,3}
Be sure your code must give appropriate output

Given number of nodes and set of edges connecting some vertices of an undirected graph, compute and output the bfs traversal of that graph.