Hi,
Can anyone provide some algorithm to find whether a linked list is circular or not ? provide the algorithm should not used normal linear search.
Thanks
...
[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
Any program is dependent on the function growth and the each part of the function is crated when a the part of the function is meaningful for the program. Growth of the function is dependent on ou...
[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 try to use C# to illustrate HashTable algorithm. I decide to make a small dictionary in ConsoleApplication(VS2008).
But my problem is: error "Null reference" in "if(hashtable...
[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 Windows, use I/O completion ports for this, with the number of threads set to approximately the number of cores in the machine.
Search for IOCP.
...
[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
A queue is a particular kind of collection in which the entities in the collection are kept in order and the principal operations on the collection are the addition of entities to the rear termina...
[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
Given three algorythms.
1) Has a complexity of O(1)
2) Has a complexity of O(n)
3) Has a complexity of O(n Log n)
4) Has a complexit of O(n*n)
Which will execute the fastest???
[...
[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 if any one can correct me on my recursive bubble sort:
Code:
Algorithm recursiveBS(A[i], n)
Input: And array of integers that are ordered or unordered
Output: An a...
[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
i have task to process many text files (already done ) and to look into each text file
few almost repetitive sentences that differs in 5 worlds from each other
my question is there...
[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
can anybody please recommend readings on algorithm analysis
(book or url / pdf or doc files) for college students
thank you
...
[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
Too bad everyone is silent. Or are you just making up you minds?
But here - I googled this press release [http://www.storagenewsletter.com/news/software/meralabs-patented-new-storage-technolog...
[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 was going through MAX-HEAPIFY and I encounterd like this
The running time of MAX-HEAPIFY on a subtree of size n rooted at given node i is the Θ(1) time to fix up the relationsh...
[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 agree that they might be dependent on the previous values. Can you perform a test for me? Try making the comments and printing them out in the following order (meaning each one is a separate 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
This is a bit of a math question, but I'll ask it here partly because I don't belong to any math forums, and partly because the computational complexity of the answer is important.
Given two v...
[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 hav a problem at hand...plz help out. I am not allowd to compuet o(n)...i need to compute the algorithm in O(log n).
Suppose there is some number N, and there are 7 elements in anoth...
[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 am trying to write a code in C++ for K shortest paths between source and destination nodes. Using the the Dijkstra's algorithm i am able to get the first shortest path and i am not able...
[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
what would be the worst case upper bound on the maximum no. of paths possible in between a source-destination pair for a completely connected undirected graph ?
my answer (in latex format):
...
[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,
I'm working on a project in C#, and it involves Markov Models. I've done a lot of research and read papers on this topic and its use in predicting user needs. However, I don't kn...
[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 minimum spanning tree is built by adding edges one at a time, prioritizing those edges with high values. Is this true?
In minimum spanning trees, an edge is added if it does not form a ___...
[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 was wondering what the best way to store dynamic arrays in SQL was. The 2 options I can think off off the top of my head are:
1) create new tables for the items you want stored in the d...
[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
WOULD THIS FUNCTION BE CORRECT
int depth_of_closest_leaf(Node *root) {
int result = +Infinity;
if(root->left!=0)
result = 1+depth_of_closest_leaf(root->left);
if(root-...
[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
thank you very much for your solution.
In the meantime I found some other solution.
There is ready to use class BitConverter.
It works perfect.
...
[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
It finally worked thanks a lot.
...
[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
Sure, though I doubt it will help you, this solves the problem of weather there exists an MST of the given graph that comply with the restriction you gave.
I assume you are familiar with Kruskal...
[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
Given an Array A of 'n' arbitrary and an array B of n integers having either o,-1,1 write an efficient function to rearrange the elements of arrays A with the following requirements.
a) if 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
Hi all,
I have a record of above 4 lak patients in a binary file. How can i search for a particular patient with different conditions fast. can any one suggest me a good method.
...
[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 
