Shellsort and optimization

[Geryon]

i'm working on sorting algortihms and i found strange code for Shell sort in The Art Of Programming Volume 3 (Donald E. Knuth) it'a self modifying code for NIX machine. Now i have lots of questions in my head.
What do you thing about self modifying codes ? Is it good for  speed/size optimization ? would you give some samples ?
What is the basic tricks ?

Thank for your interested and i'm sorry for my garbage english.

[hutch--]

Geryon,

Just code it up and see if it works OK. The fastest shell sort I have seen is a design by Janet Incerpi and Robert Sedgewick and I have the example floating around somewhere but note that a shell sort can be beaten for speed by a quick sort and can be beaten for robustness in terms of data ordering by a variety of other designs.

[Geryon]

Just code it up and see if it works OK.

really ?! do you read all of the my post ?

The fastest shell sort I have seen is a design by Janet Incerpi and Robert Sedgewick and I have the example floating around somewhere but note that a shell sort can be beaten for speed by a quick sort and can be beaten for robustness in terms of data ordering by a variety of other designs.

ok i will search this at google

[hutch--]

I found it. You have the C algo it was derived from, a manually optimised version and an unoptimesed version to play with.

[attachment deleted by admin]

[Geryon]

Thanks