G

@genie

24.03.11. concept: tree recursion

C
2 years ago
#include <stdio.h> #include <unistd.h> void func(int n) { char c; c = n + '0'; if(n>0) {

24.03.11. concept: recursion, linear (head rcs, tail rcs)

C
2 years ago
#include <stdio.h> #include <unistd.h> void func(int n) { char c; c = n + '0'; if(n>0) {

c01_ex00: ft_ft(int *nbr)

C
2 years ago
#include <unistd.h> #include <stdio.h> // delete void ft_ft(int *nbr); void ft_ft(int *nbr) { *nbr = 42; } int main(void)

c01_ex02: ft_swap (tested with int)

C
2 years ago
#include <unistd.h> #include <stdio.h> void ft_swap(int *a, int *b) { int temp; temp = *a; *a = *b; *b = temp; }

ptr to ptr : C01_02

C
2 years ago
#include <unistd.h> #include <stdio.h> //DD void ft_ultimate_ft(int *********nbr); void ft_putchar(char c); //3DD void ft_putchar(char c) { write(1, &c, 1);

C01_ex02 :ptr to ptr

C
2 years ago
#include <unistd.h> #include <stdio.h> void ft_ultimate_ft(int **nbr); void ft_putchar(char c); void ft_putchar(char c) { write(1, &c, 1);

24.03.09 C00_ex02 ptr to ptr

C
2 years ago
#include <stdio.h> #include <unistd.h> void ft_ultimate_ft(int *********nbr); int main() { int *********ptr9; ptr9 = NULL; ft_ultimate_ft(ptr9); printf("after: %d", *********ptr9);

rush00_ex00

C
2 years ago
#include <unistd.h> void rush00(int x, int y); int main() { rush00(1,5); return 0; } void ft_putchar(char a) {

rush00.ex02_draft

C
2 years ago
#include <unistd.h> void ft_putchar(char c); void rush(int x, int y); int main(void) { rush(1, 5); return (0); }

24.03.09 ptr: print ele,adr using write/printf

C
2 years ago
#include <unistd.h> #include <stdio.h> #include <string.h> int main() { //char arr_char[] = {a,b,c}; //not possible, first use in func char arr_char[] = {'a', 'b', 'c'}; // Define and init array //01.print element //write(1, arr_char, 1); //argument: const void *

c01_ex04: ft_ultimate_div_mod

C
2 years ago
/* */ #include <stdio.h> void ft_ultimate_div_mod(int *a, int *b);

c01_ex01_ ft_ultimate_ft:ptr to ptr to.. (unfinished)

C
2 years ago
#include <stdio.h> //DD void ft_ultimate_ft(int *********nbr); void ft_putchar(char c); //3DD void ft_putchar(char c) { write(1, &c, 1); }

c00_ex07: ft_putnbr (recursion)

C
2 years ago
/* func displays nub entered as prmt -all possible val within int type var -recursive, unsigned int */ #include <unistd.h> void ft_putchar(char c) { write(1, &c, 1); }

Rush00_04 (ver1)

C
2 years ago
#include <stdio.h> /* void ft_putchar(void) //in ft_putchar.c { } */ void rush(int x, int y) //in rush04.c

Rush00.ex00 (ver1)

C
2 years ago
#include <unistd.h> void rush(int x, int y) { int id_x; int id_y = 1; while (id_y < y) { id_x = 1;

Rush00.ex00

C
2 years ago
#include <stdio.h> /* void ft_putchar(void) //in ft_putchar.c { } */ void rush(int x, int y) //in rush04.c

24.03.09 write can print multisized int

C
2 years ago
#include <unistd.h> #include <stdio.h> int main(void) { char str[] = "1234"; int count = sizeof(str) - 1; // -1 to exclude the null terminator printf("%d", count); //output: 4 write(1, str, count); //output: 1234 (printed earlier) return 0; }

c00.ex06. ft_print_comb2(final OK ver/not submitted)

C
2 years ago
#include <unistd.h> void ft_print_comb2(void); void ft_print_comb2(void) { int nb1; int nb2; char nb1_str[2]; char nb2_str[2];

24.03.09. pritnf vs write: priority / print int using write

C
2 years ago
#include <unistd.h> #include <stdio.h> #include <string.h> #include <stdlib.h> int main() { printf("1. Writing a space character\n"); write(1, " . ", 3); write(1, "\n", 1);

24.03.09 write: basic example

C
2 years ago
#include <unistd.h> #include <stdio.h> #include <string.h> #include <stdlib.h> int main() { printf("1. Writing a space character\n"); write(1, " ", 1); printf("2. Writing an integer\n");