Suggestions about algorithm optimization for function "insertSorted" in InitExecutor

## Issue Description

Type: *bug report* or *feature request*

### Describe what happened (or what feature you want)
The function **insertSorted** in **InitExecutor** use InsertSort Algorithm currently.
Personally, I think we can use **binary search** algorithm
or replace **List** with **PriorityQueue**.
What do you think?

### Describe what you expected to happen
Look forward to your reply.
Thanks!

### How to reproduce it (as minimally and precisely as possible)

NONE

### Tell us your environment
NONE

### Anything else we need to know?

NONE

Start by reading InitExecutor and locating the insertSorted function to understand its current insertion-sort behavior and how the List is used. Compare the proposed binary-search or PriorityQueue alternatives, but note that the issue provides no reproduction, benchmark, test, or acceptance criteria; a maintainer decision would be needed before implementation.

Written by the indexing model from the issue text.