The way the program was initialy designed ...it spent most of its time lookin for the postion of the number( in querry ). So it became obvious tht this pattern needed to b changed..to acheive this i also changed the way the numbers were strored...i used a stucture ...which held the value of number ..as well as its position in file( i.e. when it occurs ) and a link to another such structure..also while storin this list..it is not stored one after the other...but pretty much like the way we were shown in class as to how to improve the anagram.c program..here i mod the num by the NUM_BUCKETS to determine in which slot of the main LIST does this number fall into.....so while gettin the postion of the query...less num of nodes a are travelled....n thus the total time spent in thbis function call reduced tremendously!! with this the time spent on input.large.0 came down to < 0.54u 0.02s 0:00.59 94.9% > Since this was more than sufficient than the required performance enhancement..i decided to stop here...the time given above is when the num of buckets in the array is 300...if we increase the num of buckets..then we reduce the tot time as well...but considerin the space limitations..i think 300 was enuf...as each node is of 8 bytes..so tot mem allocation for the list is 2400 bytes...(which is less than the specified limit of 4000 bytes).
(How many spelling and grammar errors were you able to find?)