find . -name *.hh -exec sed -i "s/Dealing flop \[??,??,??\]/Dealing flop \[??, ??, ??\]/g" '{}' \;

int myFuction(int int){
...
}

def get_balance(account_number):

def get_balance(account_number=account_number):

#include<stdio.h>
void f(double)
{
    double dummy;
    printf("%lf\n",*(&dummy-2)); //offset of -2 works for *my* compiler
}

int main()
{
    f(3.0);
}

#include <stdio.h>

int mutliply(int, int);

// I think the correct way should be:
// int multiply(int x, int y);

int main(void){
  int x, y, ans;
  
  printf("What would you like to multiply today? ");
  scanf("%d%d", &x, &y);
  
  ans = multiply(x, y);
  
  printf("The answer is: %d", ans);

  return 0;
}

int multiply(int x, int y){
  int ans;
  
  ans = x * y;
  
  return ans;
}

from timeit import Timer

def insertionSort(ul = [23, 65, 1, 2, 3, 4, 5, 6 , 4, 109, 43, 9]):
    for j in range(len(ul)):
        key = ul[j]
        i = j - 1
        while i >= 0 and ul[i] > key:
            ul[i + 1] = ul[i]
            i -= 1
        ul[i + 1] = key
    return ul


if __name__=='__main__':
    from timeit import Timer
    t = Timer(lambda: insertionSort())
    print(t.timeit(number=1000000))

from timeit import Timer

def insertionSort(ul):
    for j in range(len(ul)):
        key = ul[j]
        i = j - 1
        while i >= 0 and ul[i] > key:
            ul[i + 1] = ul[i]
            i -= 1
        ul[i + 1] = key
    return ul

if __name__=='__main__':
    from timeit import Timer
    t = Timer(lambda: insertionSort([23, 65, 1, 2, 3, 4, 5, 6 , 4, 109, 43, 9]))
    print(t.timeit(number=1000000))

def function(data=[]):
    data.append(1)
    return data

print('the feature')
print(function())
print(function())
print(function())

def insertionSort(ul = [23, 65, 1, 2, 3, 4, 5, 6 , 4, 109, 43, 9]):
    for j in range(len(ul)):
        key = ul[j]
        i = j - 1
        while i >= 0 and ul[i] > key:
            ul[i + 1] = ul[i]
            i -= 1
        ul[i + 1] = key
    return ul


print('the sort')
print(insertionSort())
print(insertionSort())
print(insertionSort())

>>> 
the feature
[1]
[1, 1]
[1, 1, 1]
the sort
[1, 2, 3, 4, 4, 5, 6, 9, 23, 43, 65, 109]
[1, 2, 3, 4, 4, 5, 6, 9, 23, 43, 65, 109]
[1, 2, 3, 4, 4, 5, 6, 9, 23, 43, 65, 109]

def insertionSort(ul = [23, 65, 1, 2, 3, 4, 5, 6 , 4, 109, 43, 9]):
   print "ul before sort = %s" % ul
   ...

a = [1,2,3]
b = a
b[1] = 0
print a