Describe ways to generalize a simple sorting algorithm such


Question: Imagine that you have been assigned to implement a sorting program. The goal is to make this program general purpose, in that you don't want to define in advance what record or key types are used.

Q: Describe ways to generalize a simple sorting algorithm (such as insertion sort, or any other sort you are familiar with) to support this generalization

Provide the answer of this question and also explain why?

Request for Solution File

Ask an Expert for Answer!!
Data Structure & Algorithms: Describe ways to generalize a simple sorting algorithm such
Reference No:- TGS0945040

Expected delivery within 24 Hours