InfoQ Homepage Presentations The Algorithms Still Count
The Algorithms Still Count
49:08
Summary
Shawn Wallace takes a look at several problems explaining how to evaluate possible solutions and to compare with each other.
Bio
Shawn Wallace in an Architect with Centric Consulting in Columbus, Ohio. He has been building software for nearly 20 years for all kinds of clients and even owned a software company for 9 years. Shawn is a former US Marine Infantryman and enjoys all things tech, learning about new shiny things, building things, shooting sports and coaching his son in football and watching his daughter.
About the conference
Code PaLOUsa is a two-day software development conference to be held March 16 and 17, 2012 at the Marriott Louisville in downtown Louisville, KY. The conference is designed to cover all aspects of software development regardless of technology stack. We will have sessions revolving around Microsoft, Java, and other development platforms; along with the sessions on higher level topics that are platform agnostic. The conference schedule will feature presentations from well-known professionals in the software development community. There will be fifty-five hour-long presentations and panel discussions, plus a keynote each morning of the event.
Jul 13, 2012
-
-
Forrester Thought Leadership Paper: Building Value Streams with Feature Management Platforms
Related Sponsored Content
-
-
Related Sponsor
Community comments
hi,at 00:21:25,the ppt which say binary sort has a O(log n) is wrong
by 郭 冰,
Recursion
by Álvaro Pagliari,
hi,at 00:21:25,the ppt which say binary sort has a O(log n) is wrong
by 郭 冰,
Your message is awaiting moderation. Thank you for participating in the discussion.
it is binary search ,not binary sort, sorting algorithms have o(n logn) as the limit now
Recursion
by Álvaro Pagliari,
Your message is awaiting moderation. Thank you for participating in the discussion.
.Net with C++, C#, VB... and all the others imperative languages are not optimized for recursion. If you really want to use recursion, you should use a functional language and stick with "tail recursion".