对数组a = [1, 2, 3, 4, 5, 6, 7, 8]实现分块查找算法，块的长度为4，查找并输出数组元素“6”的下标值，若查找失败，则输出-1。

```python def block_search(arr, target, block_size): for i in range(0, len(arr), block_size): if target in arr[i:i + block_size]: return i + arr[i:i + block_size].index(target) return -1 a = [1, 2, 3, 4, 5, 6, 7, 8] block_size = 4 target = 6 result = block_search(a, target, block_size) print(result) ``` [2024-06-04 14:39:37 | AI写代码神器 | 134点数解答]