Anonymous
Y guys can solve it
Mar!o
Wtf pls kick him
Anonymous
My algorithm is: it'll claim that the array is already sorted and claim that it is the best at sorting and any attempt to prove otherwise is an attack from biased media
Asdew
You seriously need to learn.
Anonymous
Anonymous
Dima
Dima
Not even a warn
Dima
Let’s see
Anonymous
The definition of sorting is to arrange elements in a certain order
Dima
He actually broke the rule about instant request on join
Dima
So ban it will be
Anonymous
Not in ascending or descending
Mar!o
Thanks! What a dick
Anonymous
BTW
Anonymous
Can someone explain average complexity?
Anonymous
Like how do you even calculate it?
Dima
Wait.... kick is actually the same as ban
Dima
Lol Rose
Mar!o
Anonymous
Anonymous
Bogosort can have best case O(1) and average case all of those
Mar!o
Mα∂ɦµ I just want to inform you that the VM project you were interested in will be done in C with a rich Rust wrapper no pure Rust as we loose to much performance in Rust due to missing computed goto. Also a friend of mine wanted to use it from raw C (he makes his own OS).
Erkin
Erkin
Mar!o
I will! Have a nice day, no bugs and fun with your project :)
Erkin
But average o(n) ? İs this possible ?
Anonymous
Anonymous
Like timsort just executes insertion sort for <64 elements
Anonymous
Some like cocktail sort are useful for tape drives
Mar!o
What about Stalin sort?
Erkin
More than time complexity you must also know where to use an algorithm
Ofc if it's not like that don't exist many of sorting algorithm
Anonymous
Well O(n) best,worse,avg
Anonymous
But it's slightly difficult to implement
Anonymous
You must send an array to a function
Anonymous
Then calculate the new length
Anonymous
So your function will return size_t and the array must be modified as the argument
Anonymous
Or you can use pascal's approach where the first element is an int that tells the length of the array
Anonymous
Not sure if that's PASCAL's
Erkin
when I do int *arr;
sizeof(arr)/sizeof(int) always equal 2. Why?
Sinan
8/4
Kashyap
https://youtu.be/AMVqVIkOyu0
Kashyap
/get cbook
Dima
your favorite I guess:)
Kashyap
Sorry, I didn't know
Kashyap
/get cppbook guide
Kashyap
/get cppbookguide
Mar!o
Naiko
is there anyone who can help me please?
Asdew
Just ask your question.
MᏫᎻᎯᎷᎷᎬᎠ
professor
in my example , I am using read() , but I want to make it depend windows only using MSVS CRT , what other options do I Have with ? https://dpaste.org/VrXj#L
Naiko
https://pastebin.com/fHHZFPqQ
Naiko
there are 4 tourists instead of 5, they also enter / get off the bus incorrectly ... I'm going crazy ...
Naiko
can no one help me ??
Cyber9ja
Can anyone recommend textbook for C++
crt
crt
let alone 2200
Anonymous
@mahouShoujo https://t.me/joinchat/DY4ws0-BPuy8brjTvj39cg
V
Anonymous
NXiss7 here goes the implementation for your question
Yes I'm very late
// a simple trick to get a random ID. Walk through the entire list and randomly
// replace any element with any other element. Then get the first 36 bytes and
// copy that into update id. Note that numbers are given higher priority so they
// appear several times in the list
static char *getuuid(char *update_id) {
char a[] =
"012345678900987654321qwertyuiopasdfghjklzxcvbnm123456789009876543210";
for (unsigned long i = 0; i < strlen(a); ++i)
swap(&a[i], &a[random(strlen(a))]);
a[36] = 0;
strcpy(update_id, a);
return update_id;
}
static void swap(char *a, char *b) {
static char temp;
temp = *a;
*a = *b;
*b = temp;
}
// This function only exists to silence a compiler warning
static int random(unsigned long length) {
int a = rand();
a %= length;
return a;
}
Anonymous
I just assume update id is the same size as that of a uuid represented as a lowercase string
Hermann
does anyone use benchmark libraries to measure performance?
Francisco
Anonymous
Hello.
I have this srun command.
srun -p ac -n1 --cpus-per-task=24 HelloOMP
I need to see the output and also se queue, how can I see it?
NXiss7