Programming for coverage part 6

Drawing insights We can draw interesting insights from measuring code coverage. This is a binary search that I borrowed from the internet and used in my talk on prime path coverage in GCC at TechTown 2024, very slightly revised. It returns the index of the needle (x) in a sorted array, or not-found (-1) if it could not be found. int bs ( const int A [], int N , int x ) { int min = 0 ; int max = N…