Why is this not a benefit? It's hard to predict how much time this system call consumes, hence dynamic allocation are not allowed on safe systems. Additionally heap pages are more likely to be paged out and you might need to synchronize access to heap memory since it's a global resource. Also, you can't leak memory on the stack

https://stackoverflow.com/questions/35109476/is-there-anything-similar-to-javas-string-charat-method-in-c Check this.

Why and what is this channel for

sha256sum( date in seconds since epoch + nanoseconds * current cpu speed )

Why is this not a benefit? It's hard to predict how much time this system call consumes, hence dynamic allocation are not allowed on safe systems. Additionally heap pages are more likely to be paged out and you might need to synchronize access to heap memory since it's a global resource. Also, you can't leak memory on the stack

graph->matrix = (int **)malloc(graph->N * sizeof(int *)); for (int i = 0; i < graph->N; ++i) { graph->matrix[i] = (int *)malloc(graph->N * sizeof(int)); }

graph->matrix = (int **)malloc(graph->N * sizeof(int *)); for (int i = 0; i < graph->N; ++i) { graph->matrix[i] = (int *)malloc(graph->N * sizeof(int)); }

If you need a matrix, why not allocate it at once? graph->N * graph->N * sizeof(int)

If you need a matrix, why not allocate it at once? graph->N * graph->N * sizeof(int)

graph.c|62 col 19 warning| assignment to ‘int **’ from ‘long unsigned int’ makes pointer from integer without a cast [-Wint-conversion] [c/gcc]

it might be a good solution to have a linear array with size N*N and compute the address with col + row * noCols

so I can do like this right? graph->matrix = (int **)malloc(sizeof(graph->N * graph->N))

struct Graph { int N; int **matrix; } * graph;

struct Graph { int N; int **matrix; } * graph;

and when you used it as matrix[x][y] it will be matrix[y*N+x]

rather x * N + y :)

🤷‍♂️ it depends on the usage I guess

Calculator

Something else?

Maze generator (console app)

What's your level?

Can you please explain me this it looks interesting.

that's pretty hardcore

Help !! There's seriously frustrating-illogical problem happening with my code, in this part (line 188 of attached code): sort(_fam_size_order.begin(), _fam_size_order.end(), [&_fam_costs, &inverted](int a, int b){ return inverted?(_fam_costs[a]>_fam_costs[b]):(_fam_costs[a] < _fam_costs[b]); }); Program runs as expected but if I change greater/less than signs to <= and >= , program doesn't run at all. No Compilation error, No runtime warning - It just doesn't print anything at all !!! Using mingw-64 on windows 10. Compile command : g++ -lpthread -Wl,--no-as-needed -static-libstdc++ -static-libgcc .\santa_workshop\dt.cpp -o .\santa_workshop\dt.exe -Wall For sidenote : Currently, I'm saving output to file, but it doesn't print anything on console as well. Here's the code : https://pastebin.com/Fzk4BRew

Can anyone decompile Android so files

hey is that kind of dynamic array allocation fine?

It's a 2D array

hmm... then what should I do?

Something else?

This seems to be pretty interesting. Do you have any project idea that makes use 0f databases?