| Title | Count visits in selection sort |
| Catalog Type | SLCItem |
| Persistent ID | https://codecheck.io/files/horstmann/codecheck-bj-4-sort-102 |
| Platform Name | CodeCheck |
| Features | Code Completion |
| Description | In section 14.3, we approximated a count of the array visits in selection sort. Your task is to provide an accurate measurement for the implementation used in section 15.1. Count each occurrence of a[i] as a visit. For example, each call to swap counts as four visits. |
| Keywords | Sorting and Searching |
| Author | Cay Horstmann |
| Institution | San José State University |
| Iframe URL | https://codecheck.io/files/horstmann/codecheck-bj-4-sort-102 |
| Protocol | SPLICE, LTI 1.1 |
| Protocol URL | |
| License | https://creativecommons.org/licenses/by-nc-nd/4.0/ |
| Programming Language | Java |
| Natural Language | en |