So, been playing with Python more and more as the days go by, I've almost forgotten about my C++ compiler (which I started with first out of all the new IDEs). I love how dynamic and fluid it feels to create new snippets of code. I think I'll take a break from learning the other languages I've written up to learn for myself and divert that extra time for more proficiency in Python (and possibly see/learn how to convert between python and C). However, I'm going to need start developing something other than (relatively) simple math programs and see what I actually can do with Python's fullest potential.
On another note, for the past 5 months I had been developing an algebraic algorithm for extended FOIL (first, in, out, last) operations to be written in my first language, Java, which met success about 2 weeks ago. It's still really in prototype code phase but ultimately it does what I've desired for it to do in place of physically writing lengthy operations.
My algorithm is dependent upon a dual-set of array lists, basically sets of constants for the linear equations being generated (say, (a*x+b) being one of the linear equation in question) ; which, through the method I developed in conceivably one of the most alien possible means, runs a recursion of these array list elements to generate the constant-multiple term for each polynomial order and outputs the complete polynomial.
This "algorithm", I'm sure, could be written any number of ways, many probably much faster and easier to understand; as a recursion process it follows has a branching method it utilizes to solve for all possible values the constant multiple of the polynomial order it is assigned to, filling in data from the array lists given and terminating "dead branches" whenever it encounters a specific branch that would be determined "out-of-boundary" as per the rule-set the algorithm follows. Interestingly enough, there is a correlation for Pascal's triangle for every instance and tree that the algorithm generates in its recursion process but it eludes me on how to draw a connection between the two in a way that can feasibly be implemented codewise. It's this particular project/problem I am now fiddling with for conversion over to Python while optimizing the tangled mess of Java-code for both projects.
However, if anyone is has had their interest piqued by such a problem or just like to torment themselves with algebra, feel free to ask more about the algorithm as I would love to share its evils. I'll forward or attach the file upon request.
Not much else done in anything else other than C++, which everything I have done I can do in Python or Java.
So, to re-cap.
Ruby - on the back-burner until a viable machine for Linux can be made present, diddling here and there
HTML - haven't even started...
Pascal - almost forgot about it, probably should look in between projects
Python - fuckin. lovin. it.
C++ - meh, should fiddle with it more
Java - about the same as before
On another note, for the past 5 months I had been developing an algebraic algorithm for extended FOIL (first, in, out, last) operations to be written in my first language, Java, which met success about 2 weeks ago. It's still really in prototype code phase but ultimately it does what I've desired for it to do in place of physically writing lengthy operations.
My algorithm is dependent upon a dual-set of array lists, basically sets of constants for the linear equations being generated (say, (a*x+b) being one of the linear equation in question) ; which, through the method I developed in conceivably one of the most alien possible means, runs a recursion of these array list elements to generate the constant-multiple term for each polynomial order and outputs the complete polynomial.
This "algorithm", I'm sure, could be written any number of ways, many probably much faster and easier to understand; as a recursion process it follows has a branching method it utilizes to solve for all possible values the constant multiple of the polynomial order it is assigned to, filling in data from the array lists given and terminating "dead branches" whenever it encounters a specific branch that would be determined "out-of-boundary" as per the rule-set the algorithm follows. Interestingly enough, there is a correlation for Pascal's triangle for every instance and tree that the algorithm generates in its recursion process but it eludes me on how to draw a connection between the two in a way that can feasibly be implemented codewise. It's this particular project/problem I am now fiddling with for conversion over to Python while optimizing the tangled mess of Java-code for both projects.
However, if anyone is has had their interest piqued by such a problem or just like to torment themselves with algebra, feel free to ask more about the algorithm as I would love to share its evils. I'll forward or attach the file upon request.
Not much else done in anything else other than C++, which everything I have done I can do in Python or Java.
So, to re-cap.
Ruby - on the back-burner until a viable machine for Linux can be made present, diddling here and there
HTML - haven't even started...
Pascal - almost forgot about it, probably should look in between projects
Python - fuckin. lovin. it.
C++ - meh, should fiddle with it more
Java - about the same as before
0 Comments On This Entry
Trackbacks for this entry [ Trackback URL ]
← September 2017 →
S | M | T | W | T | F | S |
---|---|---|---|---|---|---|
1 | 2 | |||||
3 | 4 | 5 | 6 | 7 | 8 | 9 |
10 | 11 | 12 | 13 | 14 | 15 | 16 |
17 | 18 | 19 | 20 | 21 | 22 | 23 |
24 | 25 | 26 | 27 | 28 | 29 | 30 |
Tags
My Blog Links
Search My Blog
0 user(s) viewing
0 Guests
0 member(s)
0 anonymous member(s)
0 member(s)
0 anonymous member(s)