Anti-Bloatware competition
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
How about who could create a WOPR, like in the movie war games.
"I do not know with what weapons World War 3 will be fought, but World War 4 will be fought with sticks and stones." Einstein "Few things are harder to put up with than the annoyance of a good example." Mark Twain
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
Chris Maunder wrote:
Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
Or image processing, like maybe flood fill[^]? </shameless-plug> :-\ :-O Seriously, that sounds like a great idea! We aren't anywhere close to achieving the best use of the memory and processing power available to us, because most people don't make it a priority anymore.
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
I don't think I'd take on anything that difficult/involved just for fun; how about: Sieve of Eratosthenes Levenstein Distance
-
"Hello world"
"Why don't you tie a kerosene-soaked rag around your ankles so the ants won't climb up and eat your candy ass..." - Dale Earnhardt, 1997
-----
"...the staggering layers of obscenity in your statement make it a work of art on so many levels." - Jason Jystad, 10/26/2001ROFLOL
____________________________________________________________ Be brave little warrior, be VERY brave
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
One of the very real life challenges is the riddle of the 8 queens, placing 8 queens on a chess board without 1 being able to 'take' another. A previous employer of mine had the world record in the least number of words used... Also has some nice technology challeges with collections / arrays, recursion, reuse etc
____________________________________________________________ Be brave little warrior, be VERY brave
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
How about this one: http://thedailywtf.com/Articles/Nerds,-Jocks,-and-Lockers.aspx[^] Scroll down the article there is a simulation at the end.
-
Mustafa Ismail Mustafa wrote:
Ideally, you'd also limit what we can and can't do and what parts of the framework can and can't be used.
If you're including a/the framework I think you may have already lost. :)
If its in .NET, you can't really do anything without the framework, now can you? :)
If the post was helpful, please vote, eh! Current activities: Book: Devils by Fyodor Dostoyevsky Project: Hospital Automation, final stage Learning: Image analysis, LINQ Now and forever, defiant to the end. What is Multiple Sclerosis[^]?
-
How about this one: http://thedailywtf.com/Articles/Nerds,-Jocks,-and-Lockers.aspx[^] Scroll down the article there is a simulation at the end.
How about a version of Linux that can be shoved onto an iPhone and allows you to do everything the iPhone can't (Such as secure your data/copypasta/interface with something other than iTunes) and also have it boot in half the time, work on the network AND take up say...1/2 the size of the current iPhone OS... Also, it may provide you an interesting sandbox for OTHER "apps" to go on it, and one rule of producing "apps" for this iNix would be that they have to be as small as possible. Oh, and being Free, Open Source, and Public, there would be almost no way for crap to sneak through, as long as everything gets peer checked and can not possibly be any smaller will it be approved for download onto the NixPhone. Just a suggestion...and so much more fun than the others... -Kasterborus Light a man a fire and he's warm for the night, light that man on fire and he's warm for the rest of his life...
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
Can we use APL? ..... This topic causes us old guys to remember .... I remember vowing to never write an SNMP layer for our TCP/IP unless I could get the TSR to be less then 10K of DOS memory. I did it in 2K. The good olde days of only having 640K for everything ....
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
A couple of years after Pentiums came out, I was still testing all my code on an old 486 with bugger-all memory. That made a lot of users happy. Games developers should be forced to do the same thing.
I wanna be a eunuchs developer! Pass me a bread knife!
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
It's a great idea! I'd probably vote Travelling Salesman or Comparing Large Lists. The latter sounds particularly suited for memory & computing power optimization. :) We should also set some basic rules. For example, only the core algorithm would count for comparison between solutions, while input data loading, results printout, etc. would not. I would think .NET, Java and dynamic languages should be banned from such a competition... there's no way they could win against C/C++, asm etc. int terms of memory usage and performance.
2+2=5 for very large amounts of 2 (always loved that one hehe!)
-
Chris Maunder wrote:
Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
Or image processing, like maybe flood fill[^]? </shameless-plug> :-\ :-O Seriously, that sounds like a great idea! We aren't anywhere close to achieving the best use of the memory and processing power available to us, because most people don't make it a priority anymore.
-
I don't think I'd take on anything that difficult/involved just for fun; how about: Sieve of Eratosthenes Levenstein Distance
PIEBALDconsult wrote:
Sieve of Eratosthenes
Mmm. That must be lingering around somewhere. :)
Luc Pattyn [Forum Guidelines] [My Articles]
The quality and detail of your question reflects on the effectiveness of the help you are likely to get. Show formatted code inside PRE tags, and give clear symptoms when describing a problem.
-
A couple of years after Pentiums came out, I was still testing all my code on an old 486 with bugger-all memory. That made a lot of users happy. Games developers should be forced to do the same thing.
I wanna be a eunuchs developer! Pass me a bread knife!
I still use 3 pentium 200 Mhz machines on a daily basis for the system I maintain. Also an old AMD K62 that is still hanging in there. The rest of the system has been upgraded to P4's :-D
-
I still use 3 pentium 200 Mhz machines on a daily basis for the system I maintain. Also an old AMD K62 that is still hanging in there. The rest of the system has been upgraded to P4's :-D
P4s!!! Wow! You can use TONS of memory with the average P4 system!
I wanna be a eunuchs developer! Pass me a bread knife!
-
P4s!!! Wow! You can use TONS of memory with the average P4 system!
I wanna be a eunuchs developer! Pass me a bread knife!
:laugh: Just checked one of my test work stations... 50meg still free of 64meg available. Still room for expansion!
-
:laugh: Just checked one of my test work stations... 50meg still free of 64meg available. Still room for expansion!
You could try the Adobe standard, of loading every font on the system into memory independently for each Adobe app that's running. Or have Day of the Tentacle and DooM running in the background.
I wanna be a eunuchs developer! Pass me a bread knife!
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
Language is kind of key here. And a lot of "lean and mean"-ness comes from linking correctly. To get rid of stuff in the C runtime library you don't need (want). Hello world is really pretty huge with a default c++ build. c# brings in tons of code at runtime that you didn't write, but the .exe can be teeny. In asm, it's not a lot bigger than the size of the string. So I'm hoping that describing your custom build will be part of the entry :) ...Steve
-
This article[^] got me thinking about something that is dear to my heart: the loss of the art of staying lean and mean. I'd like to run a fun competition to see who can write the leanest, meanest, most efficient (power, memory, cycles - you name it) solution to a standard problem. Any suggestions on what that problem should be? - travelling salesman - towers of hanoi - soduko solver - sorting / filtering - comparing large lists - ...?
cheers, Chris Maunder The Code Project Co-founder Microsoft C++ MVP
-
How about a full particle system whilst you there :) Havn't found any decent ones ;p
-= Reelix =-
Try Blenders: http://www.blender.org/ I've been using it tones over the last month and I can say 2 things: 1) it's really fast, and 2) it produces fabulous results, esp in hair-generation mode. You might just like it as an un-bloated particle system.
The worst thing about the darkness is the light at the end - DX-MON
