|
The problem definition is not complete.
View image: blind maze[^]
Patrice
“Everything should be made as simple as possible, but no simpler.” Albert Einstein
|
|
|
|
|
I'm new here and not sure where to post thisI need a code so that someone could copy a link from a website and paste and save into a pop up box from a software program for later viewing. The link will be embedded into an image and they just click on it to get them to the site. Any ideas?
|
|
|
|
|
You've described some requirements ... steps ... that could be performed manually or partially by an existing program ... And an "link" is distinct from a "image" (not "embedded").
My idea is that you need to express in more concrete terms what the "code" should actually "do" and how a "user" (not a bot) interacts with the process.
|
|
|
|
|
The code already exists in most applications, and is commonly executed by the Ctrl+C - Ctrl+V sequence. The first thing you need to decide is what this program of yours is supposed to do: copy, copy and paste, or just paste. Also what language do you plan to write it in?
|
|
|
|
|
I should prepare an Algorithm Exam but some of the Questions sound strange to me... if someone can help me it can be really great...
-It's possible to order an HEAP in time o(n log(n))?
-It's possible to create an HEAP in time o(n log(n))?
-It's possible to order a BST in time o(n log(n))?
-It's possible to create a BST in time o(n log(n))?
Thank you from now and sorry for my bad english
modified 9-Feb-16 11:13am.
|
|
|
|
|
|
Hi,
Given a set of points data, does any one know how to formulate Bezier Spline surface.
Thanks in advance.
SSETH
|
|
|
|
|
Please post questions once only.
|
|
|
|
|
My earlier question is completely different than this one..
Thanks.
|
|
|
|
|
It may be slightly different, but in essence it is the same issue.
|
|
|
|
|
No Richard..The earlier question was for "curve"... And this one is for "surface". which is pretty complex than Curve.
|
|
|
|
|
Not really, a surface is composed of two curves, so it is the same question. If you don't understand curves, you won't understand surfaces. Simple as that.
|
|
|
|
|
Can any one suggest how to create C2 continuous piece wise Bezier spline curve with vector method?
Thanks in advance.
~SSETH
|
|
|
|
|
What do you mean by create?
|
|
|
|
|
Does it make any sense to test decision tree on dataset generated randomly? example: (the output "true"/"false" is not conditioned on parameters 1-10)
for (int i = 0; i < l; i++)
{
string[] new_ex = new string[11];
new_ex[0] = ThreadSafeRandom.ThisThreadsRandom.Next(60)%5 == 1 ? "true" : "false";
for (int r = 1; r < 5; r++)
new_ex[r] = (ThreadSafeRandom.ThisThreadsRandom.Next(60)%3).ToString();
for (int r = 5; r < 7; r++)
new_ex[r] = (ThreadSafeRandom.ThisThreadsRandom.Next(60)%3).ToString();
for (int r = 7; r < 9; r++)
new_ex[r] = (ThreadSafeRandom.ThisThreadsRandom.Next(20)%5).ToString();
for (int r = 9; r < 11; r++)
new_ex[r] = (ThreadSafeRandom.ThisThreadsRandom.Next(4)).ToString();
dataset.Add(new_ex);
}
|
|
|
|
|
If your goal was obfuscation, you've accomplished that.
(Consider a generic string LIST and .Add method in the main body).
|
|
|
|
|
coding issues are not relevant, its more like theoretical question but thanks for hints
|
|
|
|
|
I've used random number generation to simulate queues / arrival rates; so yes, decision trees based on random data has it's place.
|
|
|
|
|
Let's assume that ‘k’ is an integer that indicate and reveals exactly the length of subset that sum to 0. Thus length of subset to pick is determined by ‘k’. If I would like to pick only ‘k’ distinct set of integers from any given set of integers in polynomial time without having needed to check through every possible length other than the chosen length. What will be the time complexity and the size of subset for every given subset sum problem?
For example:
Given a set of integers {-3, 17, 30, 12, -8 -15, 7, 45, 16, 9} is there a non-empty subset whose sum is zero? Yes, because k = 5. Output {-3, 17, -8, -15, 9 = 0}
Given a set of integers {12, 5, -6, 7, -22} is there a non-empty subset whose sum is zero? No, because k = null. Output none
Given a set of integers {8, 20, 3, 35, -2, 3, 40, 7, 16, -9, 25} is there a non-empty subset whose sum is zero? Yes, because k = 5. Output {8, 3, -2, -9 = 0}
Given a set of integers {-2, 10, 15, 20, 3, 12, 45, -6, 17, 1, 18, 5} is there a non-empty subset whose sum is zero? Yes because k = 9. Output {-2, 15, 3, 12, -45, -6, 17, 1, 5 = 0}
etc..
modified 5-Feb-16 13:17pm.
|
|
|
|
|
|
Thanks for the response but what I’m trying to say is that will I always find solution in polynomial time if ‘k’ is always right for every given subset sum problem?
|
|
|
|
|
See my April 2014 Tip/Trick: Subset - Sum Problem with Numeric Collections [^]
which includes a very efficient way to generate all possible combinations of n items.
Optimizing to make it more efficient for combinations of n choose k should not be too difficult.
"Fairy tales do not tell children the dragons exist. Children already know that dragons exist. Fairy tales tell children the dragons can be killed."
- G.K. Chesterton
|
|
|
|
|
Thanks for the response but what I’m trying to say is that will I always find solution in polynomial time if ‘k’ is always right for every given subset sum?
|
|
|
|