|
Hello everybody.
My question regards the existence of a search algorithm for searching source code. In my project, I will have to implement an application that will search through a repository of source code (through a lot of source code files). All the...
Started by Andrei on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
It has everything you requested plus to your target identifier in a string or comment unless you insist) can search across multiple lanuages of thousands of files (much faster than grep....
You might consider the SD Source Code Search Engine .
|
|
I wondered how Google find the exact word ,even if we mistyped it in search box. I want to know if such open source algorithm is available.?.
Thanks you.
Started by vipin k. on
, 5 posts
by 5 people.
Answer Snippets (Read the full thread at stackoverflow):
Or if you're using java....
Check out Peter Norvig's How to Write a Spelling Corrector article .
Take a look at this Python Implementation of a suggester, which implements something similar (though no doubt not as clever as Google's) to what Google does .
|
|
I have coded an algorithm for search in sorted array with complexity log2(n)/5 .Is it useful?
Started by sahil garg on
, 7 posts
by 7 people.
Answer Snippets (Read the full thread at stackoverflow):
algorithm i have made is interpolation search(linearIt is provable....
Why don't you post your algorithm is given to an algorithm's asymptotic complexity .
Tough question.
Be faster to search it linearly than branching.
|
Ask your Facebook Friends
|
What searching algorithm/concept is used in Google?
Started by LittleBoy on
, 8 posts
by 8 people.
Answer Snippets (Read the full thread at stackoverflow):
Inverted index and MapReduce is the basics....
The Anatomy of a Large-Scale Hypertextual Web Search Engine
PageRank is a link analysis algorithm used by Google for the search engine, but the patent was assigned to Stanford University .
|
|
How does the search algorithm on stackoverflow work? I need to implement a search functionality in one of my web sites.
Started by Ramesh Soni on
, 6 posts
by 6 people.
Answer Snippets (Read the full thread at stackoverflow):
Enclose your....
SQL Server Full text search
and as stackoverflow saying:
You're browsing through questions matching search terms search stackoverflow Search within specific tags by adding them in brackets, like [tag] or [tag-2].
|
|
I've got a list of 10000 keywords. What is an efficient search algorithm to provide auto-completion with that list?
Started by murali on
, 6 posts
by 6 people.
Answer Snippets (Read the full thread at stackoverflow):
This should be ....
A trie: http://en.wikipedia.org/wiki/Trie gives you O(N) search time whenever you type a letter (I'm assuming you want new suggestions whenever a letter is typed).
I think binary search works just fine for 10000 entries.
|
|
Do you memorize algorithms such as binary search / quick sort / whatever. If so, do you have any tricks for doing so?
Started by Ben Aston on
, 8 posts
by 8 people.
Answer Snippets (Read the full thread at stackoverflow):
Seek to comprehend instead of memorizing....
Cheers
I don't memorize them in the sense of rote memorization of code or pseucode, but I could always code binary search and quicksort from memory.
I hope this helps.
Clarify the algorithm better.
|
|
I am using networkx package to draw power law graphs. I want to simulate a search algorithm on this graph and want to visually see the algorithm move from one node to another on the graph. How do I do that?
Started by Peter on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
Did you read the drawing -chapter in its documentation?.
NetworkX supports drawing using Graphviz and matplotlib.
On a mac you could use NodeBox: http://nodebox.net/.
|
|
I have a project on benchmarking String Matching Algorithms and I would like to know if there is a standard for every algorithm so that I would be able to get fair results with my experimentation. I am planning to use java's system.nanotime in getting...
Started by Shamko on
, 5 posts
by 5 people.
Answer Snippets (Read the full thread at stackoverflow):
I am not entirely sure what you're asking algorithm performs as you ....
You need to run your algorithm hundreds, or even thousands of iterations to get reuse objects, unless it is part of your algorithm.
The most realistic results.
|
|
Hello there,
I'm writing a distributed Go/Gomoku bot.
Basically the point is to distribute tree search onto many computers. With basic tree search algorithms like DFS this would be very simple, as I could just partition search space into subtrees. Though...
Started by kurczak on
, 4 posts
by 4 people.
Answer Snippets (Read the full thread at stackoverflow):
As @Pascal Cuoq rightly mentions , Monte Carlo Tree....
Explanation of MoGo's search algorithm and how its parallelized:
http://www.lri.fr/~gelly/paper/nips mentioned would be something like map reduce with different search tree roots.
|