This program can use the golden string to calculate Viswanath's constant.
More details about Viswanath's curve here [http://groups.myspace.com/ViswanathsCurve]>.
Code:
Option Stric...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
Hi there,
I'm working on a PhD in an engineering field and it requires a bit of programming. My programming knowledge is extremely limited so I'm having a bit of a tough time with it.
I'm wo...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
I need some algo gurus. Here is a problem.
I have numbers from 1 to 64. They are always different in that range.
Many of them happen many times, some of them not.
I just want to create ...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
Hello all expert programmer, i looking for an algorithm to sort a link list. I found out that merge sort is best suitable in link list.
http://www.chiark.greenend.org.uk/~...s/listsort.html [...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
Hello all expert programmer, i looking for mergesort version for link list but i don't understand the algorithm.
http://www.chiark.greenend.org.uk/~...s/listsort.html [http://www.chiark.green...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
WARNING: Theoretical question ahead...and may not be worth your time.
My friends and I are arguing right now about sub ranges. If we were to make a type "cents" that consists of th...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
Hi everyone,
In this document:
http://www.cs.vassar.edu/~cs241/BHProof.pdf [http://www.cs.vassar.edu/~cs241/BHProof.pdf]>
Theorem 1
"There are at most ceiling(n/2power(h+1) no...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
I was wondering why we don't use DFS in Max flow problems (or do they use?) I read an article where it was specifically mentioned that Breadth first search is used and not Depth First Search... Is...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
Hi
I have 2 questions regrading the above algorithm:
How many numbers of 1000 bits are indeed prime?
(it should be about 1/X of the numbers. what is X?)
What is the average number o...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
I somewhat understand Chain, Linear, and Quadratic hashing, but I am confused about double hashing.
I'd like to know if any of you could help with a couple questions I'm stuck on.
First qu...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
the code is:
Code:
w = 0;
while (true){
k = 0;
while (a[k] == nil){
k = k + 1;
if (k == n+1)
System.exit();
}
w = w +1;
b[w] = a[k]
c[w] = 1;
a[k] = nil;
for (int j = k...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
I have two tables, table implements using List<int[]> structure.
The table has two columns(which mean int array is of size two)
List<int[]> tablea;
List<int[]> tableb;
...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
I am kind of confused with this instruction:
Describe a recursive algorithm for finding both the minimum and maximum elements in an array A of n elements. Your method should return a pair (a,b...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
An array A contains n -1 unique integers in the range [0, n-1], that is, there is one number from this range that is not in A. Design an O(n) -time algorithm for finding that number. You are allow...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
Hi folks,
I'm keen on writing a piece of software that takes a university student's timetable options (Multiple classes, multiple tutorials, contacts and lecture options for each class etc) an...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
I have seen the iterative and recursive ways of calculating the factorial of a number but is there an efficient of way of doing it say in a log-time or something?
...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
Quote:
Originally Posted by JimK
Why you have selected to use C# and not Python? [I believe it is more efficient than C# for such a problem]
Please...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
This release contains a WPF user interface.
The source code can be download from http://www.symbolware.com/aima [http://www.symbolware.com/aima]>
AIMA blog: http://blogs.symbolware.com/?ca...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
As a matter of curiosity, we keep reading so many algorithms but if I'm not mistaken, it must be taking a lot of coding to actually get that to work. There is this job scheduling problem whose sol...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
When a set of lines not parallel to each other are given. What is the best way of getting the visible lines? These are in the 2D space and I'm sort of viewing from y=infinity...
I thought of u...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
In a binary tree, will the order that values are inserted always be the same as the preorder traversal?
For example, inserting ints in this order: 6 2 1 4 3 5 7
will produce a binary tree t...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
Hi All,
I need an efficient algorithm for this trouble. I need a function f(A,B) which says if string B is contained in string A. The characters of string B only need to be in the right order, l...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
How do I transform a non-threaded binary tree into an completely inorder threaded binary tree wherein the null left and right sons of a leaf are made to point to its inorder predecessor and inorde...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
I'm able to sort the contents of the tree in level-order using the tree and a queue; but is there any way to do it using the tree only and a dummy variable like an integer or a character?
...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
I'm trying to duplicate a binary tree with the following code:
treeNode* copy(treeNode *root) {
treeNode *dupRoot, *dupLeft, *dupRight;
if (root!=NULL) {
dupLeft=copy(root->left)...
[Tags: No tags defined yet] - Be the first to Tag this threadAdd TagsCancel
*Note: Tags must be comma (,) seperated. For example: boardtracker, forum search, search engine
Browse sub-categories 
