Rob I do try to take things at face value. I went back over what has been said and haven't found where you or anyone has said that it's created each time a scipt is run. Very likely I misunderstood something. My assumptions are only testing what I think so I know whether or not I get it. Since I now know it's created new each time something is run that makes a big difference to my understanding. It's fine to tell me to take your posts at face value but if I'm left with a question about it the face value is not a value. I'm not trying to be disrespectful however what is plain to you isn't to me. So Merry Christmas and thank you for the excellent discussion

CodeAcademy's tutorial is pretty good. The interaction is great.

And here is a similar one but this time, both lists remain...

months = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December'] newMonths = [] monthlen = len(months) for i in range((monthlen - 1),-1,-1): month = months[i] newMonths.append(month) print(newMonths)

Thanks for the pointer. Something that I've wanted to look at but not known where to start 🙂

The most common sample of recursion is always doing factorials, of course. So here it is in Python.

def main(): num = int(input("Please enter a non-negative integer.\n")) fact = factorial(num) print("The factorial of", num, "is", fact) def factorial(num): if num == 0: return 1 else: return num * factorial(num - 1) main()

I do the same technique when I am working in BASH. It just makes coding cleaner and easier. I find that even for small programs and quick scripts that it is a good habit to get into.

Here is the code for using the above list to make a LinkedList and to insert some test data:

myList = linkedList() for x in range(1,10): y = Node(x) myList.insert(y) print(myList.size())

Fair point.

@Dominica said:

Ah, so it's showing how long it takes in relation to the others? That's a great visual.

Yes, you can see how long the sorts take given different sorting methods as well as with different starting points (different algorithms work better or worse with different types of data) and you can see it working it through so that you can somewhat tell how the algorithm is doing the sort as it goes. It's a little too fast to do that well, though. I wish that it was a little slower.

Care to share?

I really need to take some time to learn F# and really get into functional programming. Now that F# is going to be widely available on Mac and Linux as well as Windows, it is a lot more interesting.

Apparently some counterpoint has come out...

http://techrights.org/2014/11/12/openwashing-lockin/

@Dashrender said:

I guess I'm going to have to look this up, I've never heard of Functional Programming.

It's pretty big today. In general, though, people aren't switching to F# or Haskell. Instead they use the new functional extensions in C# or other languages to mix functional and procedural elements together to make it far easier for non-functional programmers to add functional elements without being unable to program normally.

I've heard of Haskell and Groovy, but that's about it.