R

@ryu

ft_split

C
1 year ago
#include <stdio.h> #include <stdlib.h> #include <assert.h> #include <string.h> int ft_strncpy(char* s1, char* s2, int n) { int i; i = 0;

ft_convert_base

C
1 year ago
#include <stdio.h> #include <stdlib.h> #include <limits.h> int len(char* str); int white_space(char c); int check_base(char* base); long long ten_base(char* nbr, char* base); int find_char(char ch, char* base_to); char* tranlate_loop(long long num, char* base_to, int size, char* arr);

strjoin

C
1 year ago
#include <stdlib.h> int len(char *str) { int i; i = 0; while (str[i] != '\0') i++; return (i);

ft_strjoin

C
1 year ago
#include <stdio.h> char *ft_strjoin(int size, char **strs, char *sep) { int i; char *result; int index; i = 0; index = size * 2 - 1;

ft_ultimate_range

C
1 year ago
#include <stdio.h> #include <stdlib.h> int ft_ultimate_range(int** range, int min, int max) { int i; int* arr; i = 0; if (min >= max)

ft_range

C
1 year ago
#include <stdio.h> #include <stdlib.h> int* ft_range(int min, int max) { int range; int* arr; int i; if (min >= max)

ft_strdup

C
1 year ago
#include <stdlib.h> #include <stdio.h> int len(char* str) { int i; i = 0; while (str[i] != '\0') {

ft_sort_params

C
1 year ago
#include <stdio.h> int len(char* str) { int i; i = 0; while (str[i] != '\0') { i++;

ft_sqrt

C
1 year ago
#include <stdio.h> int ft_sqrt(int nb) { int num; int i; num = 0; i = 0; while (1)

ft_recursive_power

C
1 year ago
#include <stdio.h> int ft_recursive_power(int nb, int power) { if (power < 0) return 0; if (power == 0) return 1; if (nb == 0 && power == 0) return 1;

ft_recursive_factorial

C
1 year ago
#include <stdio.h> int ft_recursive_factorial(int nb) { if (nb < 0) return 0; if (nb <= 1) return 1;

ft_iterative_power

C
1 year ago
#include <stdio.h> int ft_iterative_power(int nb, int power) { unsigned long long r; int i; r = 1; i = 0;

ft_iterative_factorial

C
1 year ago
#include <stdio.h> int ft_iterative_factorial(int nb) { int i; unsigned long long r; i = 2; r = 1; if (nb < 0)

ft_is_prime

C
1 year ago
#include <stdio.h> int ft_is_prime(int nb) { int i; i = 2; if (nb == 0 || nb == 1) return 0;

ft_find_next_prime

C
1 year ago
#include <stdio.h> int check_prime(int num) { int i; i = 2; while (i < num) { if (num % i == 0)

ft_fibonacci

C
1 year ago
#include <stdio.h> int ft_fibonacci(int index) { if (index < 0) return -1; if (index == 0) return 0; if (index == 1) return 1;

ft_atoi_base

C
1 year ago
#include <stdio.h> #include <assert.h> #include <string.h> int ft_strlen(char *str) { int count; count = 0; while (str[count] != '\0')

ft_putnbr_base

C
1 year ago
#include <stdio.h> #include <assert.h> #include <string.h> #include <limits.h> int len(char* str) { int i;

rush01

C
1 year ago
#include <stdio.h> #include <stdlib.h> void ft_write(int d) { printf("%d ", d); } typedef struct p

ft_putstr_non_printable

C
1 year ago
#include <stdio.h> void print(char c) { printf("%c", c); } void translate(int c, char *o) { int r;