typedef struct string name; string id; int age; bool school; bool green;Student;按这个结构体写一个快速查找查找学生id

int searchStudentById(Student students[], int n, string id) { int left = 0, right = n - 1; while (left <= right) { int mid = left + (right - left) / 2; if (students[mid].id == id) { return mid; } else if (students[mid].id < id) { left = mid + 1; } else { right = mid - 1; } } return -1; // 没有找到 }