User talk:Greg Martin: Difference between revisions
imported>Aleksander Stos (Big O notation) |
imported>Greg Martin m (→Big O notation) |
||
| Line 4: | Line 4: | ||
Hi, I proposed moving "Big O notation" to "Complexity of algorithms" or something like this. A constable ([[user:D. Matt Innis|Matt]]) suggested that an opinion of an editor would be appreciated. So could you please take a look at [[Big O notation]] and my rationale given [[User_Talk:D. Matt Innis|Matt's talk page]] and leave a comment there? Thanks in advance. --[[User:Aleksander Stos|AlekStos]] 08:39, 26 March 2007 (CDT) | Hi, I proposed moving "Big O notation" to "Complexity of algorithms" or something like this. A constable ([[user:D. Matt Innis|Matt]]) suggested that an opinion of an editor would be appreciated. So could you please take a look at [[Big O notation]] and my rationale given [[User_Talk:D. Matt Innis|Matt's talk page]] and leave a comment there? Thanks in advance. --[[User:Aleksander Stos|AlekStos]] 08:39, 26 March 2007 (CDT) | ||
''I responded on [[User_Talk:Aleksander Stos|Alek's talk page]]. - [[User:Greg Martin|Greg Martin]] 17:58, 24 April 2007 (CDT)'' | |||
Revision as of 17:58, 24 April 2007
Welcome, new editor! We're very glad you've joined us. Here are pointers for a quick start. Also, when you get a chance, please read The Editor Role. You can look at Getting Started and our help system for other introductory pages. It is also important, for project-wide matters, to join the Citizendium-L (broadcast) mailing list. Announcements are also available via Twitter. You can test out editing in the sandbox if you'd like. If you need help to get going, the forum is one option. That's also where we discuss policy and proposals. You can ask any administrator for help, too. Just put a note on their "talk" page. Again, welcome and thank you! We appreciate your willingness to share your expertise, and we hope to see your edits on Recent changes soon. --Larry Sanger 15:14, 6 March 2007 (CST)
Big O notation
Hi, I proposed moving "Big O notation" to "Complexity of algorithms" or something like this. A constable (Matt) suggested that an opinion of an editor would be appreciated. So could you please take a look at Big O notation and my rationale given Matt's talk page and leave a comment there? Thanks in advance. --AlekStos 08:39, 26 March 2007 (CDT)
I responded on Alek's talk page. - Greg Martin 17:58, 24 April 2007 (CDT)