Is it realistic to use HashSet to determine if a large amount of string data (2 000 000 strings of length 20) is composed of unique entry ?
If not, is it realistic, in a more general way, to quicksort this large amount of string data in memory (not using an extern or file quicksort) ? Thank you. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "The Java Posse" group. To post to this group, send email to javaposse@googlegroups.com To unsubscribe from this group, send email to javaposse+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/javaposse?hl=en -~----------~----~----~----~------~----~------~--~---
