answersLogoWhite

0


Best Answer

quick sort is a divide and conquer method , it is not dynamic programming

User Avatar

Wiki User

12y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Is quick sort is an example of dynamic programming algorithm?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Advantages of Typeless programming language?

* In a typeless language, a variable can contain any kind of value (numeric, string, boolean). * Typeless languages are very flexible and dynamic, resulting in quick turn around of code.


What is the benefit of randomization in quick sort algorithm?

You don't waste time computing a pivot.


What are the different types of algorithm?

insertion,bubble,quick, quick3, merge, shell,heap, selection sorting


How do you sort an array of numbers?

Use a sorting algorithm. There are a bewildering number of sorting algorithms, both stable and unstable. To sort numbers, an unstable sort suffices. The algorithm you use will depend on how many numbers need to be sorted (a small or a large set), however a hybrid algorithm (a combination of two or more algorithms) can cater for both. Introsort (unstable) and timsort (stable) are the two most common hybrid sorting algorithms.


When would you use bubble sort?

Never. Bubble sort is often cited as an example of how not to write a sorting algorithm and is used purely as a programming exercise. It is never used in production code. Although reasonably efficient when sorting small lists, an insertion sort performs better on average. But for larger lists it has no practical uses. A merge sort is better for large lists, but if stability isn't an issue a quick sort is even better. Hybrid sorts typically use quick sort until a partition is small enough for an insertion sort to complete the job.


What fundamental mathematical principle underlies the effectiveness of the Quick sort algorithm to sort certain lists of data elements rapidly?

penis


Desired properties of routing algorithm are?

All packets should reach their destination (unless prevented byother factors, e.g. congestion).Data transfer should be as quick and efficient as possible. Using theshortest or fastest route helps achieve this.Routing computations should be as quick and easy as possible.The algorithm should adapt to:- Topology changes (new or removed channels).- Changing load.The algorithm should treat different users fairly


What is an example sentence that uses the word quick?

I gave a quick answer, then left.


What is quick play?

well Quick Play means that you play real quick for example I wanted to play quick play i think thats what it means


What is the antonym for quick?

Languid is one example


What programming language makes expert sysyems?

With high efficiency,less erros & bugs,fastness,security of data,quick back-up,reliability - with all these features programming language makes expert systems.


What is the action of print in java?

Both print() and println() show text in a console window. This can be useful for a first-semester (because programming a GUI is more complicated), or for some quick debugging. println() adds a line break; print() does not. Example: System.out.println("Hello.");