Well, paralellizing a "for" loop is very simple. I was wondering if there was an obvious reason why it should break the algorithm in this precise case.
Because Insertion sorting is a serial algo. It haven't a isolated data for different threads and haven't a mechanism to exchange data between threads. So, threadA can write to data from threadB (and will do it). Therefore, it can lead to either crash, or (more often) to the wrong sortand invalid contacts.
If it passes tests, it has nothing says. -- Best regards, Sergei D. _______________________________________________ Mailing list: https://launchpad.net/~yade-dev Post to : [email protected] Unsubscribe : https://launchpad.net/~yade-dev More help : https://help.launchpad.net/ListHelp
