Immediate Conditional Insertion Sort (ICIS)

Searching and sorting are basic operations of the computer used in many applications. In this paper, we have modified the traditional insertion sort algorithm to give better performance in certain types of applications. It accepts the incoming data sequentially and analyzes it immediately to determine whether it will be part of the final result or be neglected. To determine the location of the incoming new value in the results array, the ICIS algorithm uses an idea similar to the binary search algorithm, but the comparison begins by comparing the new incoming value to the maximum value in the results array, not to the middle value as in the binary search algorithm. Data is stored in the results array sorted. The ICIS algorithm is an in-place sorting algorithm and its time complexity in average and worst cases is O (n log m), where m is less than n several times (m