Search:

You're right it's a typo "w" is ok. Thanks for the tips. problem is now solved.

Regards.

Thanks but as i said before, i want to do this in c (in shell it's very simple as you post)

Thanks phantomotap for the joke.

Regards.

Thanks Salem, but i wan't to do it in c :)

Hi all,

I have a input csv file, the lines are like this (in.csv):


0123456789;CUST098WZAX;35
0123450123;CUST056TVZE;37
0123458989;CUST034XMKS;67
0123456789;CUST098WZAX;35...

Really thanks laserlight :), apologize.

Many regards.

Hello again,

I do some tests and i don't undersrand the results, i used the merge sort algorithm described here :
Mergesort For Linked Lists

And compared it to an insertion sort algorithm :
...

Tnakyou very much whiteflags :).

Regards.

Thanks iMalc, i've never heard about BucketSort, can you give some links? in my case MergeSort is about O(n*log(n)), what about BucketSort?

Regards.

Thanks Adak, cas, i fixed the problem with my merge sort algorithm, the new one is below :

Merge sort algorithm:


/* insert a node */
struct node *insert_node(int number, struct node *next) {...

Thanks cas, you're right i will try a better example for testing the worst case in insertion sort.

Thanks Adak, so you think that quicksort maybe a better choice in my case?

Thanks manasij7479, i will try to do somme threading on merge sort and see if it's better.

Thanks for the reply but i don't get the same performances with the two and i was expecting that merge sort is about o(n * log(n)) and is much better than insert sort which is o(n2).

How can i...

Well you can test with this (for the merge sort) :


int main(void) {
struct node *head;
struct node *current;
struct node *next;
int i;
struct timeval tbegin,tend;
double...

laserlight is right you need to use char ** instead of char *, something like this :


void swap(char **t1,char **t2)
{
char *t;
t=*t1;
*t1=*t2;
*t2=t;

Hi all,

I have a list that contain about (200000 elements) and i want to keep them in a sorting order, so i do some testing with insertion sort and merge sort but it seems that insertion sort is...

Hi,

can someone help me to complete my code with a function that can check the result of a timer "check_timer" and another one that reset this timer if it had expired "reset_timer"? THANKS FOR THE...

Thanks "kona49er",

I said before that i want this part to be atomic and at the same time launch the timer inside this step, so i know that my problem is (sleep + mutex), but i don't know how to do...

Thanks for the reply "Codeplug",

When you run my code, you can see that the
sleep(seconds) inside the
start_timer(void *args) function blocks other threads until she terminates (This code is...

Thanks for timer_create(), how can i deal with this function tin my case?

Thanks "Sipher" what you mean by reducing priority? May be i'm wrong instead of use sleep to launch the timer ther's other tips to do that?

Hi all,

I'm trying to do some timer thread but i have some trouble to do this, because i use sleep and it is a blocking call, so i need some more flexible function that do the job and don't block...

That's what i want thanks :), topic is now closed, great answer, and amazing philosophy.

Post your code.