# Algorithms and Time Complexity In algorithm development, the time and space required for algorithm completion is paramount. As users, we know that when a computer process takes too long, we try to...

### Algorithms and Time Complexity

In algorithm development, the time and space required for algorithm completion is paramount. As users, we know that when a computer process takes too long, we try to avoid it. This truth encourages all IT and computer-based companies to produce faster products and services.

For this assignment, write a one- to two-page paper that includes all required algorithms and pseudocode describing the time and space complexity of algorithms. Include the following:

• What is time complexity?

• What is space complexity?

2. Compare and contrast polynomial time algorithms and nondeterministic polynomial (NP) time algorithms (one paragraph minimum).

3. Provide an example of an algorithm for each worst-case run times:

• O(n).

• O(nk
).Note that this is called polynomial-time, wherekis any number greater than 1.

• NP-time.

Hint:Quick sort is an algorithm that runs inO(nlogn) time.

Answered 2 days AfterAug 09, 2021

## Answer To: Algorithms and Time Complexity In algorithm development, the time and space required for algorithm...

Pratyush answered on Aug 12 2021
Algorithm and time complexity 1
1. What is time complexity ?
Time complexity is defined as the amount of time taken by an algorithm to execute as a function of length of
the input data. Length of the input is the number of operations performed by the algorithm. In other words, time
complexity is not the total time of execution of algorithm rather it is the time taken to execute each statement of
the algorithm.
Based on the nature of statement ( or instruction ) time of run is computed. If loop exists and operations are
repeated N times, then total time complexity is N times the time taken for each operation.
Time complexity is denoted by big notation O. Time complexity has multiple forms such as O(1), O(n), O(n^2),
O(n^3), O( log n), O(n log n) etc. It is based on what function within the big O notation the execution time
follows.
#include
void main ()
{
int j, n = 6;
for ( j = 1; j<=n, j++) {
printf (“example of O(n) !!\n”);
...
SOLUTION.PDF