Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 Basque Portal?  
1 comment  




2 Binomial calc  
2 comments  




3 Francis Xavier  
1 comment  




4 re: ion drive  
1 comment  













User talk:Keta




Page contents not supported in other languages.  









User page
Talk
 

















Read
Edit
Add topic
View history
 








Tools
   


Actions  



Read
Edit
Add topic
View history
 




General  



What links here
Related changes
User contributions
User logs
View user groups
Upload file
Special pages
Permanent link
Page information
Get shortened URL
Download QR code
 




Print/export  



Download as PDF
Printable version
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 


Basque Portal?

[edit]

Kaixo, I'm contacting you because you figure in Category:User eu, meaning that you speak some Basque. You must therefore be Basque yourself or have an intense connection with the Basque Country.

I am thinking that maybe was a good idea to create a Portal (or maybe a Wikiproject? or both?) on the Basque theme but I feel such kind of project requires more than just one person.

If you are interested, please comment in my talk page.

Enjoy, --Sugaar 10:27, 4 November 2006 (UTC)[reply]

Binomial calc

[edit]

If you look at the cited reference, you'll see that the point of those examples is to demonstrate the difference between a straight recursion and a dynamic programming implementation, certainly not to provide good algorithms for binomial coefficients. The straight recursive implementation is a textbook example of how not to use recursion (and I am a Lisp guy from way back), and the dynamic programming implementation is still silly as a practical algorithm. As the cited reference shows, the D.P. implementation takes O(n^2) time -- and also O(n^2) space! -- whereas the standard loop takes only O(n) time and O(1) space (all assuming that numbers are fixed-size). --Macrakis (talk) 22:40, 28 July 2008 (UTC)[reply]

There is no 'algorithm' in the article, just some C code (with strange choice of data types). But its basic approach is fine -- but it's better to parenthesize as (accum*(n-k+i))/i. Why would you think there's a better algorithm? --Macrakis (talk) 21:12, 29 July 2008 (UTC)[reply]

Francis Xavier

[edit]

Check the Talk. Thank you. --Karljoos (talk) 21:41, 29 March 2009 (UTC)[reply]

re: ion drive

[edit]

It's an energy thing. The problem is that if the negative charge is allowed to build up, when the voltage on the spacecraft (relative to infinity) reaches the potential difference across the grid-anode, then the positive ions don't have enough energy to escape the negative attraction of the spacecraft; they would go in a wide orbit, and most of them would smack back into the spacecraft.

This would be bad; you'd have no net propulsion, and the ions would erode the spacecraft.TooComplicated (talk) 15:44, 6 August 2012 (UTC)[reply]


Retrieved from "https://en.wikipedia.org/w/index.php?title=User_talk:Keta&oldid=506080508"





This page was last edited on 6 August 2012, at 15:44 (UTC).

Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



Privacy policy

About Wikipedia

Disclaimers

Contact Wikipedia

Code of Conduct

Developers

Statistics

Cookie statement

Mobile view



Wikimedia Foundation
Powered by MediaWiki