Chapter 16 Flashcards

1
Q

Can counting sort use radix sort

A

Yes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is bucket sort algorithm

A

It is linear time algorithm. We make buckets on data set and arrange data according to that ranges. For example exam grades. It uses insertion sort for insert

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is radix sort algorithm

A

Its history is that in 1920’s punch cards were used instead of computers. A mechanical machine do radix sorting on them physically. There is limitation in counting sort that it is fit for small integers but not for big numbers. Radix id solution for big numbers. It do sorting by one digit at time.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is dynamic programming

A

It is a technique. It is recursion without repetition.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What is fibonacci sequence

A

A series of number where next number comes with the sum to last 2 numbers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Who develope fibonacci sequence

A

Leonardo fibonacci

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is memoization

A

We can prevent unnecessary repetitions by writing down the results of recursive calls and looking them up again if we need them later.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly