As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance.
Closed 10 years ago.
I am tryingt o convert a code from Mathematica to Maxima. The code is around 300 lines, I did not write it and the person who did was not good with comments. I was wondering if anyone know of a program that does converting like this?
I tried one from source forge called mixima but I could not get it to run.
Best,
Ben
Converting from Mathematica syntax to Maxima is pretty straightforward. Somewhere out on the Interwebs there is a "Rosetta Stone" of programming languages that might help. (Found this [1] which seems helpful, although I seem to recall something more extensive. Can't find anything else at the moment.)
However, the difficult part is that there might be functions which work differently in one system or the other. In particular, I think Mathematica's function for solving equations is more powerful than Maxima's. So whether or not you can translate the code depends on more than just converting the syntax. My advice is to post the code to the Maxima mailing list (maxima#math.utexas.edu) and ask whether it can be translated.
[1] http://www.axiom-developer.org/axiom-website/rosetta.html
Related
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance.
Closed 9 years ago.
I'd like to know what are the best sites to learn about formal languages, automata, algorithms and data structures. Preferable with many solved questions...
Thanks in advance
What I prefer is., a best book " On Theory of Automation", http://www.amazon.com/Introduction-Automata-Languages-Computation-Edition/dp/0321455363 .,
I have read this book., superb it is.
visit http://rosettacode.org/wiki/Rosetta_Code
You can compare also structure of programs on examples.
You didn't mentioned what kind of algorithms you want to learn. Anyway for basic algorithms and data structures TopCoder algorithm tutorial's page is a good place to start. Visit http://www.topcoder.com/tc?d1=tutorials&d2=alg_index&module=Static
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance.
Closed 9 years ago.
Is there is any implementation for hyper LogLog algorithm in R?. I found a javascript implementation :
LogLog and HyperLogLog algorithms for counting of large cardinalities
which way is better to implement the algorithm ? for example, converting the javascript implementation would be good? or should I start from scratch.
Any suggestions ?
I am not aware of an already existing implementation, although that absolutely does not mean that there none. In regard to writing the code yourself, I would not literally translate the code form the javascript code. The style I would choose in R is very different (more apply loops and vectorisation), probably the code will be shorter.
In stead of literally translating the code, I would write down the steps of the algorithm in pseude code, and then implement the R code from that pseudo code. That way you can more easily write a solution in a real R style, and you have a good opportunity to learn exactly how the algorithm works.
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance.
Closed 11 years ago.
Please suggest me some good materials or books or links that provede the methods to find the complexity of algorithms that use linked list for their implementation. My question may sound silly to some of you but please reply.Please help
Introduction to Algorithms is the canonical textbook.
It is possible to find a complete PDF of this book online. I'm not going to provide a link, though, because I'm not sure if these copies are legal.
If all you're after is a quick reference, then Wikipedia is the best place to start. For instance, see the table at http://en.wikipedia.org/wiki/Linked_list#Tradeoffs.
Gautam I have a feeling that you are trying to skip the understanding of 'complexity analysis' portion and jump to linked-list-complexity-analysis.
Just so you know, if you want to understand it truly, then you have to understand two parts
1. How to compute complexity of an algorithm
2. The flow of algorithm in question.
'linked-list-complexity-analysis ' is not something that you can understand without understanding {1}
That said, if at all you want ready answer (trust me that wouldnt help you in interviews), you can refer to this book "Data structures and algorithm and applications in C++" (http://www.mhhe.com/engcs/compsci/sahni/)
Highly recommended for beginner.
Immensely boring, and I doubt you will read it again. :P
You will find answers to your specific questions there.
After you are done with that book , I would suggest go with DataStructures using C/C++ by Langsam/tennenbaum.
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance.
Closed 12 years ago.
The programming language or The programming logic.....
Because both are equally important for good coding practice. And, please justify your answer.
What makes a program to be a good program?
Being able to address the customer needs and make him happy.
Programming language, programming logic, code style etc. are nonessential to the success.
The programming language doesn't have squat to do with a good program, you can write ugly code in C++ and elegant code in LOLcode and if they perform the same function nobody will care. Most important is that the code is bug free and performs its function.
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance.
Closed 11 years ago.
I'm still trying to learn LINQ, though it's going more smoothly now that I've started to use it daily at work. I still don't feel good at it, though. Does anyone have any challenging practice exercises or puzzles I can use as a code-kata to improve my skills?
I'll leave this as community wiki, so maybe it can grow to a community list.
If you have not discovered http://www.linqpad.net/ it lets you practice linq in a lightweight way, as well as having some inbuilt examples from C# 5.0 in a nutshell and C# in Depth books.
101 Linq Samples is a good one for reference. Not a puzzle though
I know the 1st 2 questions at Project Euler is 'LINQ' friendly, I never did any more, but it should be fun either way :)
Puzzle:
Do a full outer join in LINQ.
I've been finding "foreach's" in existing code and attempting to linq'ify them. Many times things have been different enough for me to learn new concepts or at least if they're similar I get to feel more confident that my Linq skills are getting better.