Skip to content

Instantly share code, notes, and snippets.

View rivasvict's full-sized avatar
🤘
rocking out

Victor Rivas rivasvict

🤘
rocking out
View GitHub Profile
@rivasvict
rivasvict / mergesort.c
Created June 28, 2020 18:48
A simple implementation of a mergesort algorithm
#include <stdio.h>
#include <cs50.h>
/*
Merge sort algorithm:
if n <= 1
Do not do anything, as 0 and 1 elements are already sorted
Else
Sort left half of the array
Sort right half of thr array
(function(T, R) {
const okAnswerAlias = 'OK';
const groups = new Set();
const responseGroupExpression = /.*\d/g;
let numberOfOkResponses;
for (let i in R) {
const response = R[i];
// Check only for ok responses
#!/bin/bash
# Lets assume the service is called mongo
MONGO_CONTAINER_ID=''
# Iterate until container id gets defined
while [[ $MONGO_CONTAINER_ID == '' ]]; do
echo "Waiting for container id"
# Attempt to get the mongo container id once
# docker-compose is supposed yo be running

Keybase proof

I hereby claim:

  • I am vctr90 on github.
  • I am vctr90 (https://keybase.io/vctr90) on keybase.
  • I have a public key ASA1UPUC_twJNjxw47UeS5Y__yCCRl-X0XOSN2i1e5aBCgo

To claim this, I am signing this object: