TI-BASIC competition
Posted: 16 Feb 2016, 14:57I'm very happy to say that I'm leading a competition in pure BASIC. People have to create an algorithm for doing stuff. As I'm participating too, I want to ask you not to send your programs to my e-mail. I will create either 5 or 10 tasks, what people will. Thus after 5 or 10 weeks, you have to send all your programs to me, and I will judge them all 
Rules
- Every weeks comes a new task; I will post that in this thread
- Programs will be executed on the TI-84+CE. You can use every command that is available on that calc
- Your score is mostly defined on speed, not size (see below for the scoring details)
- Don't post in any threads your code, or parts of. Also, don't steal of others
- You don't have to post that you're participating.
- After the last task, I will post how to submit all the challenges. If I have enough time, you can expect the results in 2 weeks after the closing date.
- You don't may use libraries, or ASM or whatever. Just. Pure. BASIC.
Scoring
The one with the lowest time, gets 70 points. The others are getting these points:
140-time/best_time*70
The same with speed, the smallest program gets 30 points, the others like
60-size/smallest_size*30
So you CAN earn 100 points for each task
Task 1
Create an algorithm that sorts a list in increasing order, which is both in Ans and L1. No usage of SortA( and SortD( of course
. The dimension of that list is always 256, and are integers (not complex numbers) > 0 and <= 256. The time is the amount of seconds your program take to sort 10 random lists of 256 elements. Everyone get's the same input. Output should be L1
Your program will be tested like this:
Good luck with it! If you have any questions, please post in the Cemetech thread
Rules
- Every weeks comes a new task; I will post that in this thread
- Programs will be executed on the TI-84+CE. You can use every command that is available on that calc
- Your score is mostly defined on speed, not size (see below for the scoring details)
- Don't post in any threads your code, or parts of. Also, don't steal of others
- You don't have to post that you're participating.
- After the last task, I will post how to submit all the challenges. If I have enough time, you can expect the results in 2 weeks after the closing date.
- You don't may use libraries, or ASM or whatever. Just. Pure. BASIC.
Scoring
The one with the lowest time, gets 70 points. The others are getting these points:
140-time/best_time*70
The same with speed, the smallest program gets 30 points, the others like
60-size/smallest_size*30
So you CAN earn 100 points for each task
Task 1
Create an algorithm that sorts a list in increasing order, which is both in Ans and L1. No usage of SortA( and SortD( of course
. The dimension of that list is always 256, and are integers (not complex numbers) > 0 and <= 256. The time is the amount of seconds your program take to sort 10 random lists of 256 elements. Everyone get's the same input. Output should be L1Your program will be tested like this:
- Code: Select all
{56,1,9,46,69...->L1
prgmSORTA
Good luck with it! If you have any questions, please post in the Cemetech thread
