2.at present , quicksort is the fastest sorting algorithm ? true or false
3.topological sort is one implementaion of dynamic programming? true or false
4. in insertion sort we swap (n-1) times? true of false
5. insertion sort algorithm is an example of reducing a problem instance by the same constant factor on each iteration? true or false
6. topological sort is not application for a cycle graph ? true or false
2.at present , quicksort is the fastest sorting algorithm ? true or false 3.topological sort is one implementaion of dyn
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am