Skip to content

Instantly share code, notes, and snippets.

Avatar

Christopher cciollaro

View GitHub Profile
View keybase.md

Keybase proof

I hereby claim:

  • I am cciollaro on github.
  • I am cciollaro (https://keybase.io/cciollaro) on keybase.
  • I have a public key ASDueUTB2-oaIgtSLWsUyhVumh4IYwjYrcCSl0NEur7yygo

To claim this, I am signing this object:

View keybase.md

Keybase proof

I hereby claim:

  • I am cciollaro on github.
  • I am cciollaro (https://keybase.io/cciollaro) on keybase.
  • I have a public key whose fingerprint is C448 1E99 EA31 E6C2 3B84 F63D E9FA BDBF 991B DE13

To claim this, I am signing this object:

@cciollaro
cciollaro / socialist_millionaire_sockets.rb
Last active May 10, 2016
socialist millionaire with tcp sockets
View socialist_millionaire_sockets.rb
require 'socket'
#http://www.scribd.com/doc/34203336/How-to-Implement-RSA-in-Ruby#download
# Calculate a modular exponentiation eg: b^p mod m
def mod_pow(base, power, mod)
result = 1
while power > 0
result = (result * base) % mod if power & 1 == 1
base = (base * base) % mod
power >>= 1
@cciollaro
cciollaro / socialist_milli.rb
Last active Aug 29, 2015
socialist millionaire in ruby
View socialist_milli.rb
#http://www.scribd.com/doc/34203336/How-to-Implement-RSA-in-Ruby#download
# Calculate a modular exponentiation eg: b^p mod m
def mod_pow(base, power, mod)
result = 1
while power > 0
result = (result * base) % mod if power & 1 == 1
base = (base * base) % mod
power >>= 1
end
result
View ghost_thing.rb
class Array
alias :peek :last
end
trials = gets.to_i
trials.times do |x|
stack = []
ctr = 0
ptr = 0
str = gets.chomp
View cycle_sort.rb
blocks = (0..8).to_a.shuffle
puts blocks.inspect
i = 0
while i < 8
until i == blocks[i]
j = blocks[i]
#swap blocks[i] with blocks[blocks[i]]
blocks[i], blocks[j] = blocks[j], blocks[i]
end
@cciollaro
cciollaro / lowestsha512sum.rb
Last active Aug 29, 2015
lowest sha512 sum in ruby
View lowestsha512sum.rb
require 'digest'
input = ARGV.first || "chris"
lowest_digest = Digest::SHA512.hexdigest(input)
lowest_input = input
begin
loop do
digest = Digest::SHA512.hexdigest(input)
if digest < lowest_digest
lowest_digest = digest
@cciollaro
cciollaro / test-guide
Created Dec 7, 2013
AVM testing structure
View test-guide
let's imagine you wanted to test Coin.js
1.) create test/coinTest.js
2.) write tests like these: http://pivotal.github.io/jasmine/. Jasmine is a really great library, go check out that page! :)
3.) when you've written your test, go to SpecRunner.html and include your test and dependencies like so:
<!-- include source files here... -->
<script type="text/javascript" src="js/Coin.js"></script>
<!-- include spec files here... -->
<script type="text/javascript" src="test/coinTest.js"></script>
@cciollaro
cciollaro / ModExp.java
Created Oct 17, 2013
A right-to-left binary modular exponentiation algorithm in java i.e. calculating a^b mod n
View ModExp.java
public class ModExp {
public static void main(String[] args) {
System.out.println(modExp(4,13,497));
}
public static int modExp(int a, int b, int n){
int d = 1;
String k = Integer.toBinaryString(b);
for(int i = 1; i <= k.length(); i++){
@cciollaro
cciollaro / CountingSort.java
Created Oct 5, 2013
stable counting sort in java
View CountingSort.java
public class CountingSort{
public static void main(String[] args){
int[] a = {5,6,7,1,2,4,5,6,1,0,3,4,2};
printArray(countingSort(a, 7));
}
public static int[] countingSort(int[] a, int k){
int[] b = new int[a.length];
int[] c = new int[k + 1];
for(int i = 0; i < a.length; i++)