Ex_2_1_03.md

title	date	draft	tags	categories
Algorithm4 Java Solution 2.1.03	2019-08-30 23:38:31 +0800	false	JAVA	TECH archives

2.1.03

Problem:

Give an example of an array of N items that maximizes the number of times the test a[j] < a[min] fails (and, therefore, min gets updated) during the operation of selection sort (Algorithm 2.1).

Solution：

code:

Ex_2_1_03.java

Reference：