Computing desk | ||
---|---|---|
< July 28 | << Jun | July | Aug >> | July 30 > |
Welcome to the Wikipedia Computing Reference Desk Archives |
---|
The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
I’m planning to buy an internet service system in UK. What would you suggest?
Requirement is, an Internet Modem Dongle (with or without a simcard in or with it), ‘line rental’ or ‘pay as you go’ which ever provides unlimited ‘GB’ or ‘TB’ daily, weekly and or monthly. What’s the cheapest available; currently?
Note: I would be constantly relocating accommodation places, whatever you guys think is best, please suggest.
116.58.204.130 (talk) 16:35, 29 July 2017 (UTC)
I got a list of words ( something like 250,000 words) and I want to retrive repeatedly some words starting with'a' or some words with an'e' as the 4th letter or a 'p' as the 3rd letter. How would a concise index look like? Do I need an index for each letter and position? — Preceding unsigned comment added by 31.4.145.10 (talk) 17:59, 29 July 2017 (UTC)
You could use a B-tree or even a binary tree on each letter of the word. However it should be noted that 250,000 words is a pretty small list as these things go. Just doing a linear search would not take very long. On my MacBook with a rather slow 1.7 GHz processor, "grep ^...e" to find all words in a 250,000 word list that have 'e' as the fourth letter takes 120 milliseconds. CodeTalker (talk) 18:21, 29 July 2017 (UTC)