In Progress

# Algorithm and Sorting, Big-O

Budget $30-5000 USD

1)

An algorithm to sort and list names has been made out of two other algorithms. The first algorithm will sort the names and is order O(n * log2 n). The second algorithm lists the names and is order O(n). The entire sort-and-list algorithm is therefore of order:

a) O(n).

b) O(n * log2 n).

c) O(n^2 * log2n^2).

d) none of the above.

Explain Why.

2)

The approximate number of iterations of an algorithm with data size N is determined to be:

1 + 2 + 3 + ... + N

a) Write a table that shows N and the number of iterations for the first 10 values of N.

b) What is the O-notation for this algorithm?

## Deliverables

1) Text file solution to these problems.

## Platform

N/A

## Awarded to:

$2 USD in 15 days

(61 Reviews)

6.1

## 14 freelancers are bidding on average $11 for this job

$7.65 USD in 15 days

(175 Reviews)

5.9

$25.5 USD in 15 days

(62 Reviews)

5.4

$4.25 USD in 15 days

(30 Reviews)

4.9

$8.5 USD in 15 days

(47 Reviews)

4.6

$8.5 USD in 15 days

(23 Reviews)

4.4

$4.25 USD in 15 days

(48 Reviews)

3.8

$11.05 USD in 15 days

(5 Reviews)

2.9

$38.25 USD in 15 days

(2 Reviews)

1.2

$4.25 USD in 15 days

(2 Reviews)

0.4

$6.8 USD in 15 days

(2 Reviews)

0.0

$8.5 USD in 15 days

(0 Reviews)

0.0

$17 USD in 15 days

(0 Reviews)

0.0

$6.8 USD in 15 days

(0 Reviews)

0.0