Compare commits

..
7 Commits
Author SHA1 Message Date
kevinnlsamuel 4abde22a7f format 2026-11-21 14:15:05 +05:30
kevinnlsamuel 2b6479d3a2 you thought i couldn't be lazier? 2026-11-21 14:12:49 +05:30
kevinnlsamuel 5eeec57451 base fahceltable 2026-11-21 14:11:35 +05:30
kevinnlsamuel 8a7de4bef2 because i'm lazy and tab complete filenames 2026-11-21 14:11:12 +05:30
kevinnlsamuel 08359de98a init code 2026-11-21 14:04:27 +05:30
kevinnlsamuel 5ffb9f31e9 build tools 2026-11-21 14:04:13 +05:30
kevinnlsamuel baa97b1419 init 2026-11-21 13:50:02 +05:30
9 changed files with 25 additions and 104 deletions

No files matched your search

-6
View File
@@ -1,6 +0,0 @@
**
!.gitignore
!**/
!*.c
!*.h
!*.md
+3
View File
@@ -0,0 +1,3 @@
alias m := make
make TARGET:
make .{{ trim_start_match(invocation_dir(),justfile_dir()) / trim_end_match(TARGET,".c") }}
+3
View File
@@ -0,0 +1,3 @@
%: %.c
cc $< -o $@
+3
View File
@@ -0,0 +1,3 @@
# learning c
following Kernighan and Ritchie's book
-5
View File
@@ -1,5 +0,0 @@
# Learning C
just learning the C language
the code in the repo is not licensed for reuse. but really, there isn't anything for you to use or that isn't already free to use. it's mainly for myself
-1
View File
@@ -1 +0,0 @@
main.c
-10
View File
@@ -1,10 +0,0 @@
#include<stdio.h>
#include<stdlib.h>
#include<stdarg.h>
void debug_msg(char* fmt, ... ){
va_list args;
va_start(args, fmt);
vfprintf(stderr, fmt, args);
va_end(args);
}
-82
View File
@@ -1,82 +0,0 @@
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include "../_headers/debug.h"
int* sort(int*, int);
void swap(int*, int, int);
void integeriseArgs(int, char**, int*);
int DEBUG;
int main(int argc, char** argv){
int arr[argc-1];
integeriseArgs(argc, argv, arr);
char* _debug = getenv("DEBUG");
if(_debug)
DEBUG = !strcmp(_debug,"1");
//how does this even work???
//int arr[] = {1,2,3,5,4};
int arr_len = sizeof(arr) / sizeof(arr[0]);
sort(arr, arr_len);
printf("sorted array: ");
for(int i=0; i<arr_len; i++){
if(i!=0) printf(", ");
printf("%d", arr[i]);
}
printf("\n");
return EXIT_SUCCESS;
}
int* sort(int* arr, int length){
if(DEBUG){
debug_msg("length of array to be sorted: %d\n", length);
debug_msg("elements of array to be sorted: ");
for(int i=0; i<length; i++){
debug_msg("%s%d", i==0?"":", ",arr[i]);
}
debug_msg("\n");
}
int changes = 0;
do {
changes = 0;
for(int i=0; i<length-1; i++){
if(arr[i]>arr[i+1]){
if(DEBUG) debug_msg("need to swap [%d]->%d and [%d]->%d\n",i,arr[i],i+1,arr[i+1]);
swap(arr, i, i+1);
++changes;
}
}
} while (changes != 0);
if(DEBUG){
debug_msg("=====\nelement post-sort are: ");
for(int i=0; i<length; i++){
debug_msg("%s%d", i==0?"":", ",arr[i]);
}
debug_msg("\n");
}
return arr;
}
void swap(int* arr, int left, int right){
if(DEBUG)
debug_msg("PRESWAP left[%d] is: %d; right[%d] is %d\n", left,arr[left],right,arr[right]);
int _hold = arr[left];
arr[left] = arr[right];
arr[right] = _hold;
if(DEBUG)
debug_msg("POSTSWAP left[%d] is: %d; right[%d] is %d\n", left,arr[left],right,arr[right]);
}
void integeriseArgs(int len, char** args, int* arr_ptr){
for(int i=1; i<len ; i++){
arr_ptr[i-1] = atoi(args[i]);
}
}
+16
View File
@@ -0,0 +1,16 @@
#include <stdio.h>
int main(){
int lowerF, upperF, step;
lowerF = 0; upperF = 300;
step = 20;
int fahr, cel;
printf("%s\t%s\n", "°F", "°C");
printf("%s\t%s\n", "===", "===");
for(fahr=lowerF; fahr<=upperF; fahr+=step){
cel = 5 * (fahr - 32) / 9;
printf("%3d\t%3d\n", fahr, cel);
}
}