|
|
Anagram Check
|
Ruby
|
4 Days Ago
|
0
|
|
- - -
|
- - -
|
325 Chrs
|
|
|
This program checks if two strings are anagrams of one another. This solves the J5 question on the 2007 CCC.
"Problem Description
An anagram is a word or a phrase formed by rearranging the letters
|
|
|
|
Array Manipulation
|
Ruby
|
4 Days Ago
|
0
|
|
- - -
|
- - -
|
374 Chrs
|
|
|
This code solves the 2007 CCC J3 question. Here is the question:
" Deal or no deal:
In the CCC version of the game, there are 10 possible dollar amounts: $100, $500, $1 000, $5
000, $10 000, $25
|
|
|
|
Hash use in Ruby
|
Ruby
|
4 Days Ago
|
0
|
|
- - -
|
- - -
|
813 Chrs
|
|
|
This program solves the 2007 CCC J2 question using a hash. This question revolves around replacing slang (like LOL) with plain English. Full question can be found here: http://cemc.uwaterloo.ca/ccc/20
|
|
|
|
Finding the middle number
|
Ruby
|
4 Days Ago
|
0
|
|
- - -
|
- - -
|
107 Chrs
|
|
|
This solves the 2007 CCC J1 problem. It's a remarkably simple solution. Here is the problem:
"Problem Description
In the story Goldilocks and the Three Bears, each bear had a bowl of porridge to e
|
|
|
|
Outputing Primes
|
Ruby
|
4 Days Ago
|
0
|
|
- - -
|
- - -
|
371 Chrs
|
|
|
This simple program outputs all the prime numbers between 3 and n, where n is a user entered number. Please comment on the code, as I'm still only learning Ruby.
|
|
|
|
Fibonacci's Sequence in Ruby
|
Ruby
|
6 Days Ago
|
4
|
|
- - -
|
- - -
|
247 Chrs
|
|
|
Just more random code I made in my quest to learn Ruby. If anyone knows Ruby please critique this code. Especially if you have a nice way of getting around that global variable. Eck!
|
|
|
|
Sorting Algorythms
|
Ruby
|
6 Days Ago
|
0
|
|
- - -
|
- - -
|
1,079 Chrs
|
|
|
This program contains two sort methods: sequential sort and bubble sort. I don't wither one is the most efficient out there by any means. I'm just doing this to practice Ruby (and these algorithms). I
|
|
|
|
Searching Algorythms
|
Ruby
|
6 Days Ago
|
0
|
|
- - -
|
- - -
|
563 Chrs
|
|
|
This shows the linear search and the binary search, implemented in Ruby. Note that the binary search requires a to be in ascending order. I'm just doing this to practice Ruby. If you know Ruby, please
|
|
|
|
Number of Days in which the 13th has landed on Friday
|
C / C++
|
16 Days Ago
|
4
|
|
- - -
|
- - -
|
1,523 Chrs
|
|
|
I made this program for a programming challenge to calculate how many times the 13th falls on whichever weekday. This is a slightly modified version. It counts from Jan 1 0000 to Dec 31 N, where N is
|
|
|
|
Dynamic Programming, number of ways down a slide.
|
C / C++
|
21 Days Ago
|
0
|
|
- - -
|
- - -
|
1,281 Chrs
|
|
|
It solves the S4 problem. Here's the link. It's problem four: http://cemc.uwaterloo.ca/ccc/2007/seniorEn.pdf
It's my first real dynamic programming solution.
|
|
