shell sort is a rather curious algorithm, quite different from other fast sorting algorithms. It s actually so different that it even isn t an O(nlogn) algorithm like the others, but instead it s something between O(nlog2n) and O(n1.5) depending on i

The program makes a decision about the input number. If it is a pirme number, it will try to write it, 2 or 3 prime numbers addition. If it isn t a prime number, the program will end.

The program makes a decision about the input number. If it is a pirme number, it will try to write it, 2 or 3 prime numbers addition. If it isn t a prime number, the program will end.

Ignatius is doing his homework now. The teacher gives him some articles and asks him to tell how many times each letter appears. It s really easy, isn t it? So come on and AC ME.