View call_by_reference_shellsort.c
#include <stdio.h>
#include <malloc.h>
#define FIN "algsort.in"
#define FOUT "algsort.out"
int* read(int* arr, int* n) {
int i,
num;
View mergesort.cpp
#include <iostream>
#include <fstream>
#include <vector>
#define loop(vec) for(const auto &number : vec)
#define iter(i,begin,end) for(int i = begin; i <= end; ++i)
#define FIN "algsort.in"
#define FOUT "algsort.out"
using namespace std;
View pp.c
int **pp;
int *p;
int ii;
p = &ii;
pp = &p;
**pp = 2016;
printf("%d", ii); //display 2016
View bts.c
/**
* Filename: binarytreesearch.c
* Copyright (c) 2016 Adrian Statescu (http://adrianstatescu.com)
* Licensed under the MIT, GPL licenses.
*/
#include <stdio.h>
#include <malloc.h>
#define FIN "algsort.in"
#define FOUT "algsort.out"
View tinder.css
/* Design of a card */
.card {
font-size: 14px;
line-height: 200px;
text-align:center;
width: 150px;
height: 200px;
display: block;
background: #666;
-webkit-transform-origin: 50% 99%;
View tinder.js
(function(){
var animating = false;
function animatecard(ev) {
if (animating === false) {
var t = ev.target;
if (t.className === 'but-nope') {
t.parentNode.classList.add('nope');
animating = true;
fireCustomEvent('nopecard',
View merge.cpp
#include <fstream>
#include <iostream>
#define FIN "algsort.in"
#define FOUT "algsort.out"
class Container {
public:
//constructor of the class
Container( int _n ): n( _n ){
View main.cpp
int main() {
int n;
ifstream fin( FIN );
ofstream fout( FOUT );
fin>>n;
View mergesort.cpp
#include <fstream>
#include <iostream>
#define FIN "algsort.in"
#define FOUT "algsort.out"
using namespace std;
class Container {
public:
View complex.py
import math
class Complex:
def __init__( self, a, b ):
self.a = a
self.b = b
def getModule( self ):