Introduction to the 2nd chapter of algorithms and the choice of programming questions

Series Address: Introduction to Algorithms (CLRS) reference answers and matching programming questions

2.1 Insert Sort

Exercise 2.1-1 originally titled \ (a=<31,41,59,26,41,58>\) , each time after the order changes as follows:

To demonstrate the effect, all values are reduced uniformly (10\). The following is a demonstration of the sort procedure for \ (a=<21,31,49,16,31,48>\) :

practice 2.1-2 Rewrite to a non-ascending sort result as follows:

Click to view larger image

Introduction to the 2nd chapter of algorithms and the choice of programming questions