@@ -41,13 +41,6 @@ for the k-th smallest value. This can be useful if you have previously called `a
4141to find a smaller or larger rank (that will have led to partial sorting of
4242` index ` , thus implying some constraints on the location).
4343
44- ### Licensing
45-
46- The Fortran Standard Library is distributed under the MIT
47- License. It is worth noting that ` select ` and ` arg_select `
48- were derived using some code from quickSelect in the Coretran library, by Leon Foks,
49- https://github.com/leonfoks/coretran . Leon Foks has given permission for the code here
50- to be released under stdlib's MIT license.
5144
5245## ` select ` - find the k-th smallest value in an input array
5346
@@ -102,6 +95,10 @@ Selection of a single value should have runtime of O(`size(array)`), so it is
10295asymptotically faster than sorting ` array ` entirely. The test program at the
10396end of this document shows that is the case.
10497
98+ ` select ` was derived using some code from quickSelect in the Coretran library, by Leon Foks,
99+ https://github.com/leonfoks/coretran . Leon Foks has given permission for the code here
100+ to be released under stdlib's MIT license.
101+
105102### Example
106103
107104``` fortran
@@ -199,6 +196,9 @@ Selection of a single value should have runtime of O(`size(array)`), so it is
199196asymptotically faster than sorting ` array ` entirely. The test program at the end of
200197these documents confirms that is the case.
201198
199+ ` arg_select ` was derived using some code from quickSelect in the Coretran library, by Leon Foks,
200+ https://github.com/leonfoks/coretran . Leon Foks has given permission for the code here
201+ to be released under stdlib's MIT license.
202202
203203### Example
204204
0 commit comments