correction of problem -

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 dynamic memory , but after use the dynamic memory 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 it , if we got good result for first one then we can use the dynamic memory for the second one too. third algorithm, the main problem for this algorithm related with number of characters comparison , we want checking the code for this algorithm it is correct with the technique of these algorithm or have some mistakes in the code. all of these algorithms working well under window and Linux when use all of pattern length (4,8,12,16........1024) except (24 )length. the 24 pattern length working smoothly under window but under Linux gave this result(segment fault). 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 Best regards