zerohours

def quicksort(datos, primero, ultimo):
    i = primero
    j = ultimo
    pivote = (datos[primero] + datos[ultimo]) / 2
 
    while i < j:
        while datos[i] < pivote:
            i+=1
        while datos[j] > pivote:
            j-=1

zerohours

#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
#       tiempo.py
#       Cálculo del tiempo de ordenameinto de lista
#       

import time
import random

zerohours

int getRandomize(int randMax)
{
  srand ( time(NULL) );
  int randNum; = rand() % randMax + 1;
  return 2;
}

zerohours

/*
 * log.cpp
 * 
 * Copyright 2013 Julio Cesar Brizuela @zerohours
 * 
 */

#include <iostream>
#include <log4cpp/Category.hh>
#include <log4cpp/FileAppender.hh>

zerohours

Pagination abstraction layer

• Define Pagination class
• Define PaginatedList<T> generic class
• Utility functions for parsing http response

zerohours

(Robert Cecil Martin also known as Uncle Bob Martin - SOLID)[http://www.cleancoder.com/products]

(Summary of 'Clean code' by Robert C. Martin)[https://gist.github.com/wojteklu/73c6914cc446146b8b533c0988cf8d29]

Clean Code PDF: https://www.investigatii.md/uploads/resurse/Clean_Code.pdf

Clean Code Java: https://github.com/leonardolemie/clean-code-java

SOLID Java Examples: https://www.baeldung.com/solid-principles

zerohours

package rfc3339;

import org.junit.jupiter.api.Assertions;
import org.junit.jupiter.api.Test;
import org.junit.jupiter.api.function.Executable;

import java.time.ZoneOffset;
import java.time.ZonedDateTime;
import java.time.format.DateTimeFormatter;
import java.time.format.ResolverStyle;