You have chosen to sponsor your bid up to a maximum amount of .
Hi, I have problems with three algorithms the first one have very good accuracy but the problem with time it is consumed longer time than originals algorithms. i know the main problem related with array , but after use the dynamic array to reduce this problem the algorithm not working well and it is give the ( segment fault) as the result. the second algorithm hybrid of the first one and until now not change the array for this algorithm , if we got good result for first one then we can use the dynamic array for the second one too. the third algorithm the main problem for this algorithm related with number of characters comparison so just we want checking the code for this algorithm and it is not working when use pattern length 24 under Linux but it is work smoothly with this length when use window.
all of these algorithms working under window and Linux so we want just these correction for all of these algorithms.
So please if you can help me by correcting and inform me about the reasons of the problem of these codes.
Awaiting your reply with interest