I learned the node structures this week. Those structures consists of nodes and they can be interconnected. It can be used to design a binary tree and any tree of any kind. It is very interesting to work with and also complicated.
2->3->4->7->None
This might be considered as a linked list. It's rear is pointing toward None. So I can create any tree that I want. Anyways this week I am much better with recursions and it is more easier for me to do work on Nodes.
Thursday, October 24, 2013
Sunday, October 20, 2013
append to CS thinking
Recursion is using the same function over and over again to do a certain task. It may be finding the depth of the list or finding every object in the list
Object oriented python store many things like variable and functions in a class. It is a great way to organize function in a special way. It is also very efficient for all programmers.
Object oriented python store many things like variable and functions in a class. It is a great way to organize function in a special way. It is also very efficient for all programmers.
Saturday, October 19, 2013
CS thinking
I think that object-oriented python is useful to programmers because the class in python are limited and programmer need to create new class for every purpose of the program. I may create a class where I want to store string and int or float. Normal python class won't do that. Class is an awesome way to organize functions as well as variable. Then the function can be found more easily because it is contained some where. It is like papers put into folders and we can sort them more easily.
I think recursions are useful to programmers because it can do many things repeatedly until it reach the end. Iteration and for loops won't do the exactly the same thing because iteration only do it for number of time but sometimes the number of times isn't given to you like when you have to find the depth of a list. Recursion is helpful if you have a repeated but indefinite or infinite amount of task to do. Recursion can find every leaf of the root and it is pretty helpful in storing data and organize data. You can store everything in a recursive list with a root and lots of leaves. It can save a lot of space for the code and let the code be more efficient. If the code is efficient then the program can work faster. The programmer can also do more work.
I think recursions are useful to programmers because it can do many things repeatedly until it reach the end. Iteration and for loops won't do the exactly the same thing because iteration only do it for number of time but sometimes the number of times isn't given to you like when you have to find the depth of a list. Recursion is helpful if you have a repeated but indefinite or infinite amount of task to do. Recursion can find every leaf of the root and it is pretty helpful in storing data and organize data. You can store everything in a recursive list with a root and lots of leaves. It can save a lot of space for the code and let the code be more efficient. If the code is efficient then the program can work faster. The programmer can also do more work.
Monday, September 23, 2013
Subscribe to:
Posts (Atom)