I Want to know what is the algorithmic complexity of following 1. Java String tokenizer 2. C++ STL based tokenizer 3. strtok. Is there any faster algorithm then rudimentary strtok to tokenize a string based on custom delimeter. ...
I am thinking of implement a image processing based solution for industrial problem. The image is consists of a Red rectangle. Inside that I will see a matrix of circles. The requirement is to count the number of circles under following constraints. (Real application : Count the number of bottles in a bottle casing. Any missing bottles?...
Hi, I read a couple of posts here about generating random sequence without repeats (for example http://stackoverflow.com/questions/693880/create-random-number-sequence-with-no-repeats) and decided to implement it for my own need Actually it was an algorithm applying some non-destructive (reversible) operations with the bits of the cur...
This is a hard one (for me) I hope people can help me. I have some text and I need to transfer it to a number, but it has to be unique just as the text is unique. For example: The word 'kitty' could produce 12432, but only the word kitty produces that number. The text could be anything and a proper number should be given. One problem t...
There is a list of banned words ( or strings to be more general) and another list with let's say users mails. I would like to excise all banned words from all mails. trivial example: foreach(string word in wordsList) { foreach(string mail in mailList) { mail.Replace(word,String.Empty); } } how I can improve this algori...
In an array with integers between 1 and 1,000,000 or say some very larger value ,if a single value is occurring twice twice. How do you determine which one? I think we can use a bitmap to mark the elements , and then traverse allover again to find out the repeated element . But , i think it is a process with high complexity.Is there any...
What would be the best way to compare big paragraphs of text in order to tell the differences apart. For example string A and string B are the same except for a few missing words, how would I highlight these? Originally I thought of breaking it down into word arrays, and comparing the elements. However this breaks down when a word is ...
I have a design question. I have a file that is several GB (between 3-4 GB). The file is ordered by time stamp. I am trying to figure out what the best way is to deal with this file I was thinking of reading this whole file into memory, then transmitting this data to different machines and then running my analysis on those machines. ...
I am currently implementing a BK-Tree to make a spell checker. The dictionary I am working with is very large (millions of words), which is why I cannot afford any inefficiencies at all. However, I know that the lookup function that I wrote (arguably the most important part of the entire program) can be made better. I was hoping to find ...
What would the following algorithm look like: a linear-time algorithm which, given an undirected graph G, and a particular edge e in it, determines whether G has a cycle containing e I have following Idea: for each v that belongs to V, if v is a descendant of e and (e,v) has not been traversed then check following: if we visited e b...
I'm working on a fuzzy search implementation and as part of the implementation, we're using Apache's StringUtils.getLevenshteinDistance. At the moment, we're going for a specific maxmimum average response time for our fuzzy search. After various enhancements and with some profiling, the place where the most time is spent is calculating t...
Click here to view the problem. I can't come to a solution better than O(n^2) but with n<=500000 this won't work! My Idea is to sort them by (beauty+intellect+richness) and test any of them with those after it. Please help! ...
hi, does anyone know a good and efficient algorithm for equal k subsets algorithm ? preferably c or c++ which could handle a 100 element vector maybe with a complexity and time estimation ex. 9 element vector x = {2,4,5,6,8,9,11,13,14} i need to generate all k=3 disjoint subsets with sum = 24 the algorithm should check if there are ...
Hi all, This is not a home work. I was thinking of some new questions in tree traversal and this seems to be very obvious so thought of solving it. Question is very similar to level order traversal like BFS. In BFS, we normally travel left to right in each level of tree, but here if we are travelling left to right at level i then leve...
I intend to display (4, 8 or 16 bit per channel - no alpha) images on a 1 bit display in an embedded system. Images are stored in RGB tuples. My intention is to use Floyd-Steinburg, as it looks reasonably good, is more than quick enough and concise in code. In reference to the WikiPedia article, I have two questions. What would the b...
I have a table of data and I want to pull specific records. The records are indicated in various, nigh-random ways (how isn't important), but I want to be able to identify them using 11 specific terms. Essentially, I'm being given a lot of queries against non-indexed fields and having to rewrite them using specific indexed fields -- exce...
I'm putting together a small library that consumes Geographic Information System (GIS) data and allows for fast point in feature, point near feature, and line of sight queries. Much of this data will consist of big areal features with enormous numbers of vertices. An R Tree variant might work, though I wonder how those perform on the p...
Is there a easy way to determine the local min and maxes of an array of values. For example Element Value Note 1 1 2 3 3 5 4 6 5 7 max 5 5 6 4 min 7 6 8 9 9 10 max 10 8 11 7 12 5 min 13 10 s...
I'm trying to write a program to automate a ticket draft. We have a certain number of season ticket passes and want to split up the tickets among a group of people. There are X number of games, Y number of season passes, and Z number of people. Each of Z people has ranked the X games. My code basically goes through the draft orde...
Reading through more SICP and I'm stuck on exercise 1.3.8. My code works properly for approximating 1/phi, but doesn't work for approximating e - 2. (define (cont-frac n d k) (define (frac n d k) (if (= k 0) 1.0 (+ (d k) (/ (n (+ k 1)) (frac n d (- k 1)))))) (/ (n 1) (frac n d k))) (define (eulers-...