Rashakil Fol

To heck with SAS. It is software that deserves to die.

Edit what? A string? What does editing a string have to do with measuring the distance of two strings? What are you trying to do? Why do you want to compute the distance?

[QUOTE=jbennet;1041077]This poll is rubbish, how the hell am i winning?[/QUOTE] You are popular the way Bill O'Reilly is popular.

Oh wow, it seems like they described my personality very precisely! The thing is, I picked the boxes using rand().

[url]http://en.wikipedia.org/wiki/Fibonacci_search_technique[/url]

What kind of Lisp? Common Lisp? Use SLIME. Emacs Lisp? I guess not, because then you wouldn't need to ask.

[QUOTE=vegaseat]Pure genius Dark! Here is the same in Python ... [code] print "Hello, World! I am writing in the Python programming language" [/code] How are your C# efforts coming along?[/QUOTE] Lies! You replaced the word Ruby with Python!

[QUOTE=complexTime;1044075]I also forgot to ask before... What is the time complexity of BigInteger (in Java)?[/QUOTE] Addition is O(n) where n is the number of bits in the BigInteger, and multiplication depends on the algorithm used: [url]http://en.wikipedia.org/wiki/Multiplication_algorithm[/url] . That depends on the Java implementation. I don't know about division.

Why don't you just count? Each two-address instruction eats up enough of the available instruction space to represent 2 addresses. Each one-address instruction eats up enough of the available instruction space to represent 1 address. If you don't understand what this means, ask.

The compiler doesn't see their bodies. The functions are already compiled into a library. Lookup detailed descriptions of how compiling and [i]linking[/i] works -- this is the sort of thing where half-assed explanations will leave you uncomfortable and unsure.

[QUOTE=BestJewSinceJC;1038203]Actually, at the risk of sounding whiny, I retract my statement. But I still believe that new members misuse the down vote system to "spite vote"[/QUOTE] I just automatically downvote every one of your posts. It's like when a girl punches you -- it means she loves you. Except I'm …

You need to explain your problem better. What is a subdomain? Why are "keys"? What about the binary tree lets you search efficiently? If it's just a binary tree, and not the more specific case of a binary [i]search[/i] tree, you'll just have to search through the nodes linearly.

Don't use non-open source revision control systems. They're no good anymore. Use Mercurial. Don't use Subversion unless you have large binary files or the need to control permissions for subdirectories. If you don't want either of those things, Mercurial is superior to Subversion in virtually every way. Personally I use …

Take the sum and multiply by the step size. It's that easy. Or see Simpson's method. Edit: Gah, of course you have to have fractional endpoints. So treat the first and last segments specially.

[QUOTE=Ryshad;1041831]Remember to mark the thread as solved.[/QUOTE] Who cares?

Hey, you're right, it is easy for me.

I think this sort of thing should just be... intuitively straightforward. The only part that might not be is the question of how to deal with different operator precedences. What is a program? It's merely a sequence of top level definitions! [code]<program> ::= <top-level-definition> <program> | <top-level-definition>[/code] What is a …

You need to tell us the error message and what line it's on, and you need to use CODE tags for us to want to look more closely.

openssl is open source. Uh... what do you want this for?

Just remove a letter from the first string, print that letter, and do a recursive call. Of course, you'll want to do this for each letter.

Don't use any globals (i.e. static variables) and have your function that calculates the answer be separate from the function that prints the answer.

[QUOTE=compengg;1037976][B][COLOR="Green"][B]Hi frnds... I am doing ma collg 1st yr and i am of CSE department(comp sci engg) and i want to do some additionals course on languages.I am already studying c nd c++ in ma sub and in add on to that i wanna study some other language as i …

Your problem is that you're writing very complicated and redundant code and thus it's hard to think about what your code is doing. Use a simpler algorithm to find and remove the largest and smallest values.

Don't listen to him, his complaint is logically inconsistent with the fact that you made this thread and using colors isn't going to draw extra attention to the first post of the thread.

The Akra-Bazzi theorem ( [url]http://en.wikipedia.org/wiki/Akra-Bazzi_method[/url] ) applies in this case because sqrt(n) is O(n/log(n)^2) so you can just use the Master theorem. So BestJewSinceJC's intuition is correct.

[QUOTE=arcticM;1036769]and I know u can't bound a sum[/QUOTE] Um, yes you can. For example, you can make a very rough bound: if you have a sum of j values that are each less than or equal to k, then their sum is less than or equal to j*k. You might …

Is this where an instruction contains its addresses? For example, an instruction "0000 0001 0010" might mean "copy the value from register 1 into register 2", because "0000" means "copy", and "0001" and "0010" are "addresses" of a register. I don't really know the lingo.

I don't know.

It depends on what field you're in. If you even have a desire to ask the question, that's trouble for you.

Let's say I can do it with no variables.

We Americans are completely ignorant of the event you've described. It doesn't register on anyone's radar at all. Edit: The word 'anyone' could be replaced by 'my' to achieve a more factual interpretation of things.

I have never heard the term "fabricated software." Sorry, I don't speak moron.

What is your definition of "tree"?

Your syntax is invalid. You're using the syntax for declaring a function, when you should be using the syntax for calling a function: [code]double tsurface = tsurfaceFUNCTION(radius, height, double PI);[/code] Note that you'll need to declare tsurfaceFunction before you use it, above the main function.

It depends on location, but yeah, it's competitive. Do you want to work there?

Generally speaking you use a graphics card for that... But if you want to implement them yourself, much of the good information is in textbooks. In general, search Google for "graphics algorithms" and "graphics algorithms book" -- I haven't looked closely but they seem to lead to promising results.

Just write your "codes" in Python, test it that way, and tweak your syntax in arbitrary directions so that your code suddenly becomes "pseudo" code. Thank you, and stop bothering me with your inane questions.

This seems like an excellent way to be passive-agressive.

[QUOTE=Ancient Dragon;1024470]First you will need a medical degree so that you know how to recognize a cataract when you see one. My eye specialist had to shine a bright light in my eyes in order to find them. Maybe you can do the same with a color picture -- maybe …

[QUOTE]D) Other, please explain[/QUOTE] It doesn't matter. Do what you enjoy. It's not like it's hard to learn a new language later. Realize that you'll have to mostly teach yourself C++ if you really want to learn it, because your school is going to suck at teaching you C++, probably. …

[QUOTE=paulthom12345;1003929]Yeah. i have just been noticing people putting things down for absolutely no reason.[/QUOTE] Lawl.

[url]http://lmgtfy.com/?q=sql[/url]

No, next_permutation won't work because his desired output is out of order :) Hope this helps :) [code]#include <stdio.h> int main(void) { puts("123"); puts("132"); puts("213"); puts("231"); puts("321"); puts("312"); return 0; }[/code]

You don't need to use set or get. You could write functions named setFoo or getFoo instead of using a property Foo: [code]class Point { double x, y; public Point(double x, double y) { this.x = x; this.y = y; } public double GetX() { return x; } public void …

[QUOTE=killerqb;1021945]Thanks, but when I implemented your hash function it took nearly twice as long. Any other functions I should give a whirl?[/QUOTE] Is your call to .length() getting called every time or are you assuming that will get optimized away?

[QUOTE=iamsmooth;1017911]This should cause extra usage in the time of the algorithm. However, I don't know how to convey this on paper with asymptotic notation :( Hmm...[/QUOTE] You would just write that each push and pop wolud take Theta(n) time. (And so the average time per operation is Theta(n) which is …

[QUOTE=glasnoster;1020321]Try understanding what the code does. This will allow you to find the fault. I suspect that I have made some stupid error in it, which you can easily figure out... :)[/QUOTE] Bah, I meant to uprep this post with "complete win" while downrepping the first, but forgot you could …

Static methods are just global functions that could very well have nothing to do with the class you've put them in. Methods that are not static are merely functions that, in their definition, implicitly take the object they're called on as the first parameter.

That's just saying it takes n-1 comparisons on the first pass, n-2 on the second, n-3 on the third, ... and 1 on the n-1'th pass -- so there are a total of n-1 passes. So, ask yourself: why? What does bubble sort look like? What does it do, during …

[QUOTE=sparksterz;1019183] Basically as soon as it gets to the "Array.Sort" line it crashes where "int b" is declared in the "FreePtrCompare" class saying that File y is null object/pointer reference. which it is, but I'm not entirely sure why that isn't being passed through correctly.[/QUOTE] If File y is null, …