Codingsoln - Coding Question and Answer

Compare running time (in seconds) of heap sort with insertion sort, merge sort, and quick sort on different input sizes and also for different input types (random/sorted/reverse-sorted). Code # include <stdio.h> # include <stdlib.h&…

1) Repeat the experiment for different values of n = 20000,50000, 100000, 500000 and report the time (in seconds) required to sort the elements. 2)For each of aforementioned case, consider arrays as random,sorted, and reverse-sorted and observe runnin…

Write a program to sort a given set of elements  using the insertion sort. Additionally, determine the  time required (in terms of steps) to sort the elements. (Note: assume cost of any basic operation is 1, i.e., c1 = c2 = ... = c8 = 1). 1) Repeat th…

1.  Write a program to represent an user defined sparse matrix in triplet representation Program #include <stdio.h> #define MAX 20 void read_matrix ( int a[ 10 ][ 10 ], int row, int column); void print_sparse ( int b[MAX][ 3 ]); void …

Write a program to test whether a number n, entered through the keyboard is prime or not by using different algorithms you know for at least 10 inputs. Note down the time complexity for each algorithm along with each input. Finally make a comparison…