Which of the following sorting algorithm has the running time that is least dependant on the initial ordering of the input? Data Structures 4 July 20204 July 2020StudyBlocksLeave a Comment on Which of the following sorting algorithm has the running time that is least dependant on the initial ordering of the input? a) Insertion sortb) Quick sortc) Merge sortd) Selection sort