This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
--Method to compare tables | |
function compare_tables(table1,table2) | |
temp = {} | |
if #table1 ~= #table2 then return false end | |
for _,v1 in pairs(table1) do | |
for _,v2 in pairs(table2) do | |
if v1 == v2 then | |
table.insert(temp,v1) | |
break | |
end |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Method for comparing two tuples | |
def compare_tuple(tuple1,tuple2): | |
temp = [] | |
if len(tuple1) != len(tuple2): return False | |
for val1 in tuple1: | |
for val2 in tuple2: | |
if val1 == val2: | |
temp.append(val1) | |
break | |
return (len(temp) == (len(tuple1) and len(tuple2))) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
--Initialise | |
SimpleCSV = {} | |
SimpleCSV.__index = SimpleCSV | |
--Create new object | |
function SimpleCSV.new() | |
self = setmetatable({},SimpleCSV) | |
self.csv_table = {} | |
return self | |
end |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
-- Recursive Method calculating Fibonacci Number for n | |
function fibRecursion(n) | |
if n == 0 then | |
return 0 | |
elseif n == 1 then | |
return 1 | |
else | |
return fibRecursion(n-1) + fibRecursion(n-2) | |
end | |
end |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package main; | |
import java.math.BigInteger; | |
/** | |
* Key class used to store the key's Component and Modulus | |
* @author obikag | |
* @since 2013-06-22 | |
*/ | |
public class Key { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
--Start a new game | |
function new() | |
a = {" "," "," "} | |
b = {" "," "," "} | |
c = {" "," "," "} | |
player = 1 | |
print("New game started") | |
end | |
--Print board to screen |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
---Function to determine if a number is a prime number | |
function isPrime(num) | |
if num <= 0 then | |
print("Number must be a positive integer greater than zero") | |
return false | |
elseif num == 1 then return true end | |
--[[Prime number is divisable by itself and one, | |
so we check for other factors between the prime number and one. (1 < x < num) | |
]] | |
for x = num-1,2,-1 do |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
--Recursive function to create the mathemeatical series | |
function pascal(col,row) | |
if(col == 0) or (col == row) then return 1 | |
else return pascal(col-1,row-1) + pascal(col,row-1) | |
end | |
end | |
--Prints Pascal's Triangle to the 'n'th row | |
function PascalTriangle(num) | |
if (num <= 0) then print("Number must be greater than zero") return end |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
--Create a table to store the cipher | |
cipher = { | |
A="N",B="O",C="P",D="Q",E="R",F="S",G="T",H="U",I="V",J="W",K="X",L="Y",M="Z", | |
N="A",O="B",P="C",Q="D",R="E",S="F",T="G",U="H",V="I",W="J",X="K",Y="L",Z="M", | |
a="n",b="o",c="p",d="q",e="r",f="s",g="t",h="u",i="v",j="w",k="x",l="y",m="z", | |
n="a",o="b",p="c",q="d",r="e",s="f",t="g",u="h",v="i",w="j",x="k",y="l",z="m" | |
} | |
--Function encrypts and decrypts using ROT13 | |
function ROT13(str) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
cipher = "10101111" -- must be eight digit binary number | |
--Returns the XOR of two binary numbers | |
function xor(a,b) | |
local r = 0 | |
local f = math.floor | |
for i = 0, 31 do | |
local x = a / 2 + b / 2 | |
if x ~= f(x) then | |
r = r + 2^i |
OlderNewer