Note that there are some explanatory texts on larger screens.

plurals
  1. USuser1430003
    primarykey
    data
    text
    plurals
    1. This table or related slice is empty.
    1. COit's a 32 bit, i am not getting any cpu issues, i was thinking about reading a file like 1000 integers from everyfile and adding them into an array and then again using Collection.sort to sort it and then writing into the file. I am so close now, I am using next and previous counters to keep the track of traversal of each file, as i already have kept the uniform size of the files. so it's gonna be done, i am working on this approach now, lets see, any suggestion and help in this regard would be highly appriciated
      singulars
    2. COi have sorted the millions of integer records into 10MB sorted files. now i need to merge them and make a big sorted file. But problem is that i am using scanner to read files, now i can't read the files parallel and also like we read an array. i keep the index and so on. So due to this problem i am stuck, any idea how can i do this ???
      singulars
    3. COyou mean to say that I first get the smallest value in the whole file and then traverse the whole file again, if the next read value is great then or equal to previous value, then I append next to that and so on, when my buffer reaches like 100000 records, I write that buffer in the file and then i continues this process until unless i find the largest value equal to my last value, if there is no more big value, i stop, but what if i have a end value say 10000000 and there are 5 records in the file, when i traverse the file, i will always find a next value equal to it, how to solve it ? thanks
      singulars
 

Querying!

 
Guidance

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload