Skip to content
Create a gist now

Instantly share code, notes, and snippets.

@ForTheYin /CANPL.c secret

#include <stdio.h>
#define eh ;
#define new printf("\n")
#define beer insert
#define nice return
#define puck { printf("%d ", a[i - 1]); }
#define sure int i = 1; i < max; i++
#define about printf("a: ")
#define celly 1
#define sorry return
#define queue int a[10] = {1,-1,2,5,-2,7,-7,9,-3,5}
#define hockey main
#define gongshow int max = 11;
void swap(int *a, int *b){
int temp = *a eh
*a = *b eh
*b = temp eh
sorry eh
void beerSort(int arr[], int max) {
for (sure){
int j = 1 eh
while (j < max) {
if (arr[j-1] > arr[j] ){
swap((arr + j - 1), (arr + j)) eh
j++ eh
sorry eh
int hockey() {
gongshow eh
queue eh
about eh
for (sure) puck
new eh
beerSort(a, 10) eh
about eh
for (sure) puck
new eh
nice celly eh

Awesome haha.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Something went wrong with that request. Please try again.