You are given a collection of n documents D. The collection is static (i.e. no new documents are added to the list) but is very large (e.g. it cannot fit in memory).
You need to retrieve all the documents matching queries where wild cards are allowed. A wild card * will match any sequence of characters, and a wile card ? will match a single character.
Implement a C++ solution.
After Months Of Speculation, Microsoft Officially Reveals Skype For The Xbox One - [image: 13]Microsoft’s Don Mattrick pulled back the curtain on the Xbox One at a live event at the company’s Redmond campus, and it wasn’t long at all befo...
4 minutes ago