User talk:JDHenning

 Hello JDHenning, and welcome to Wikiversity! If you need help, feel free to visit my talk page, or contact us and ask questions. After you leave a comment on a talk page, remember to sign and date; it helps everyone follow the threads of the discussion. The signature icon in the edit window makes it simple. To get started, you may


 * Take a guided tour and learn to edit.
 * Visit a (kind of) random project.
 * Browse Wikiversity, or visit a portal corresponding to your educational level: pre-school, primary, secondary, tertiary, non-formal education.
 * Find out about research activities on Wikiversity.


 * Read an introduction for teachers and find out how to write an educational resource for Wikiversity.
 * Give feedback about your initial observations
 * Discuss Wikiversity issues or ask questions at the colloquium.
 * Chat with other Wikiversitans on #wikiversity-en.

And don't forget to explore Wikiversity with the links to your left. Be bold to contribute and to experiment with the sandbox or your userpage, and see you around Wikiversity! If you're a twitter user, please follow http://twitter.com/Wikiversity. --Ottava Rima (talk) 16:37, 4 March 2010 (UTC)

something to proofread

 * OK, so far I've proofread the lede for spelling only. A few general comments:


 * 1) I see you are using British spelling. I'm more familiar with American spelling, and, as such, may be unable to determine if a word correctly uses British spelling.  Would you mind if I changed the article over to American spelling, to avoid this problem ?


 * 2) You use a lower opening double quotation mark („), while I believe both American and British English normally use the higher character for both opening and closing: "as in this example".


 * 3) You don't mention one of the criteria being the current sort status of the data. If there is a good possibility the data is already sorted, or perhaps nearly sorted, or perhaps sorted in reverse order, then different sorting methods may be appropriate.


 * 4) The nature of the key is also important, as longer keys are less suitable to certain types of sorts, such as radix. The length of the data can also be important, depending on whether the data itself must be moved around or whether pointers to the array can be sorted, instead.  Multiple keys, especially of different data types, can also complicate sorting.


 * 5) The number of records to sort is also critical, with a bubble sort only being appropriate for a small number of records.


 * 6) As for reducing the sorting time, there's the average time and also the maximum. Sometimes one is more important, sometimes the other. StuRat 16:25, 8 March 2010 (UTC)


 * 1) I'm German and when in doubt I use my old dictionary, That is, I have no preferences concerning the spelling. Additionally I have the problem that often I have no clue about the level of words and mix slang and snob English. Please feel free to change whatever you think to be not ok or what sounds strange to you (a friend once said to me about a text of mine: "It's absolutely clear what you mean, but we wouldn't say so!" Please make the necessary changes so that it is both).


 * 2) Never knew that; it's just the default setting of my computer.


 * 3) Thats right. My idea was: first some general information, then some algorithms in more detail giving their main characteristics, and I was still thinking about a general discussion about which algorithms to use best at the end. Thinking finished: there will be such a chapter.


 * 4) See chapter Stability and Indirect Sort; I think these topics will be handled in the last chapter again.


 * 5) Because of the work I was only thinking about it but not planing it yet: The different algorithms are characterized by a function with a constant. Idea is to make reference implementations, calculate the constants and make up a table and discuss the differences. I think I will come back to that later.


 * 6) For any algorithm discussed in detail I want to make a text block (don't know ho to make a nice green background) with the key information, including the big O-operator.


 * 7) Talking about bubble sort: I had a look at that chapter and decided to rewrite it as well. It got a lot of structure but too little content.


 * 8) Thanks for help!--JDHenning 11:11, 12 March 2010 (UTC)


 * You can create a green text box like so:


 * StuRat 12:21, 12 March 2010 (UTC)