cristiancrazy

/* 
   Recursive function to:
   - Search elements on arrays
   - Count elements on arrays
*/

// Find the needle on the a;
// n = the last element index on array
//     equals to arraysize-1
int getElement(int a[], int needle, int n){

cristiancrazy

/* ================================== *
 * Author: CristianCrazyIT
 * Date: 6-12-2023 (dmy)
 * Desc: Vector Plug Utilities
 * ================================== */

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

/**

cristiancrazy

/* ================================== *
 * Author: CristianCrazyIT
 * Date: 02-11-2023 (dmy)
 * Desc: Simple Searching Functions
 * ================================== */

// Binary Search
int search(int* v, int n, int needle){
    int i = 0, j = n-1, m;
    while(j >= i){

cristiancrazy

/* ================================== *
 * Author: CristianCrazyIT
 * Date: 02-11-2023 (dmy)
 * Desc: Simple Sorting Functions
 * ================================== */

/* Selection Sort on int array[N-Dimension] */
void selectionSort(int array_in[], int N){
	int min, tmp;
	for(int i = 0; i < N; i++){

cristiancrazy

/* ==========================================
 * Author: Cristian Capraro
 * Date: 03-09-2023
 * Working with: BouncyCastle & Java Security
 * :: Cryptographic Message Syntax
 * ========================================== */

package cmsoperations;

import java.security.KeyFactory;