RamonLopezEscudero

#include <stdio.h>
#include <math.h>

// Definicion de la funcion de la funcion matematica a evaluar
double funcion(float x)
{
	return (x * x) * exp(-x * x);
}

int main()

RamonLopezEscudero

#!/usr/bin/env python
# -*- coding: utf-8 -*-

# =============================================================================================================== #

# Importar liberías necesarias
import os
import platform
import subprocess
import webbrowser

RamonLopezEscudero

#!/usr/bin/env python
# -*- coding: utf-8 -*-

# Numero tope para la búsqueda de numeros primos
num_data =  200

# Llenado de la matriz con valores de 1
matriz_data = []
for i in range(num_data):
    matriz_data.append(1)

RamonLopezEscudero

#!/usr/bin/env python
# -*- coding: utf-8 -*-

# =============================================================================================================== #

# Importar librerías
import numpy as np
from basic_units import radians, degrees
import matplotlib.pyplot as plt

RamonLopezEscudero

#!/usr/bin/env python
# -*- coding: utf-8 -*-

# =============================================================================================================== #
# =============================================================================================================== #

# Importar Librerías
import time
import os
import numpy as np

RamonLopezEscudero

#include <stdio.h>
#include <math.h>

void suma_elem_array(int num_data, int *array_x, int *array_y, float *sum_x, float *sum_y, float *sum_xy,
                     float *sum_cuad_x, float *sum_cuad_y)
{
    /* ---------------------------------- */
    int i;
    /* ---------------------------------- */

RamonLopezEscudero

#include <stdio.h>
#include <stdlib.h>
#include <time.h>

void main()
{
    int counter = 0;
    int size, num, aux, lim_izq, lim_der;

    printf("Ingrese el limite superior de la lista: ");

RamonLopezEscudero

#include <stdio.h>
#include <stdlib.h>

void merge(int *array, int p, int q, int r)
{
    // Declaracion de variables
    int i, j, k;
    int n_1 = (q - p) + 1;
    int n_2 = (r - q);
    int *L, *R;

RamonLopezEscudero

#!/usr/bin/env python
# -*- coding: utf-8 -*-

def parent(index_query):
    index_parent = int(index_query/2)
    return index_parent

def left_child(index_query):
    index_lchild = (2 * index_query) + 1
    return index_lchild

RamonLopezEscudero

#include <stdio.h>
#include <stdlib.h>

int size_stack = 7;

void print_stack(int *stack, int *top)
{
    int i;
    for(i = 0; i < *top; i++) printf(" %i ", *(stack + i));
}