f you want to limit the memory requirements, which algorithm(s) would you choose
ID: 3882091 • Letter: F
Question
f you want to limit the memory requirements, which algorithm(s) would you choose? why?
if you want to limit the time required the find a solution, which algorithm(s) would you choose? why?
if you want to find the minimum cost solution, which algorithm(s) would you choose? why?
if you want to solution with the minimum number of steps, but you do not want to use a lot of memory, which algorithm(s) would you choose? why?
if you want to parallelize your algorithm, which algorithm(s) would you prefer? why?
Explanation / Answer
Inorder to limit memory requirements we need to use in-place sorting algorithms like quick sort heap sort etc. because it transforms input using no auxiliary data structure. However a small amount of extra storage space is allowed for auxiliary variables. If we want to find a solution which minimizes time we can prefer quick sort algorithm as the order is generally random. It picks an element as pivot and partitions the given array around the picked pivot.this is usually very fast. The cuycle cancelling algorithm can give us minimum cost solution. As This algorithm maintains a feasible solution x in the network proceeds by augmenting flows along negative cost directed cycles in the residual network G(x) and thereby canceling them. Min max algorithm provides us a solution with minimum number of steps with limited memory. It finds a solution with minimum steps and ,an accurate answer. We can have various minimization algorithms like approximation algorithms. Parallel algorithms help in parallizing algorithms.Almost every algorithms do so.They are highly useful in processing huge volumes of data in quick time.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.