Cormen Edition 3 Exercise 2.2 Question 4 (Page No. 29)

Consider sorting $n$ numbers stored in an array $A$ by first finding the smallest element of $A$ and exchanging it with the element in $A $. Then find the second smallest...

akash.dinkar12

3.7k views

akash.dinkar12 asked Jun 25, 2019

Algorithms
algorithms
cormen
time-complexity
descriptive

+ –

0 votes

2 answers

akash.dinkar12 asked Jun 25, 2019

2,085 views

Cormen Edition 3 Exercise 2.2 Question 1 (Page No. 29)
Express the function $n^3/1000 -100n^2-100n+3$ in terms of $\Theta$ notation.

Express the function $n^3/1000 -100n^2-100n+3$ in terms of $\Theta$ notation.

akash.dinkar12

2.1k views

akash.dinkar12 asked Jun 25, 2019

Algorithms
cormen
algorithms
time-complexity
descriptive

+ –

0 votes

2 answers

akash.dinkar12 asked Jun 28, 2019

644 views

Cormen Edition 3 Exercise 7.4 Question 2 (Page No. 184)
Show that quicksort’s best-case running time is $\Omega(n\ lg\ n)$.

Show that quicksort’s best-case running time is $\Omega(n\ lg\ n)$.

akash.dinkar12

644 views

akash.dinkar12 asked Jun 28, 2019

Algorithms
cormen
algorithms
quick-sort
time-complexity
descriptive

+ –

0 votes

1 answer

akash.dinkar12 asked Jun 26, 2019

508 views

Cormen Edition 3 Exercise 2.3 Question 4 (Page No. 38)
We can express the insertion sort as a recursive procedure as follows.In order to sort $A[1\dots n]$, we recursively sort $A[1 \dots n-1]$ and then insert $A[n]$ into the sorted array $A[1 \dots n-1]$. Write a recurrence for the running time of this recursive version of insertion sort.

We can express the insertion sort as a recursive procedure as follows.In order to sort $A[1\dots n]$, we recursively sort $A[1 \dots n-1]$ and then insert $A[n]$ into the...

akash.dinkar12

508 views

akash.dinkar12 asked Jun 26, 2019

Algorithms
cormen
algorithms
sorting
time-complexity
descriptive

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

1 1 comment reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 reply

Please log in or register to add a comment.

Related questions

1 1 comment

0