Anyone have a clue what this code does?
-
:confused:
void set_ptList(int len, int *start) { int i, z, l; i = 0; z = 0; while (i < len) { if (new_settings[3][i] != act_settings[3][i]) { if (i < (len-1)) { if (new_settings[3][i] > act_settings[3][i+1]) { i++; z++; } else { for (l = i; l >= i-z; l--) { list[*start][0] = 3; list[*start][1] = l; (*start)++; } z = 0; i++; } } else { l = i; i++; while (z >= 0) { list[*start][0] = 3; list[*start][1] = l; (*start)++; z--; l--; } } } else { i++; } } }:confused:Have a nice life!!
it shows there is no need for obfuscators in the modern toolbox. :laugh:
Luc Pattyn [Forum Guidelines] [My Articles]
this months tips: - before you ask a question here, search CodeProject, then Google - the quality and detail of your question reflects on the effectiveness of the help you are likely to get - use PRE tags to preserve formatting when showing multi-line code snippets
-
:confused:
void set_ptList(int len, int *start) { int i, z, l; i = 0; z = 0; while (i < len) { if (new_settings[3][i] != act_settings[3][i]) { if (i < (len-1)) { if (new_settings[3][i] > act_settings[3][i+1]) { i++; z++; } else { for (l = i; l >= i-z; l--) { list[*start][0] = 3; list[*start][1] = l; (*start)++; } z = 0; i++; } } else { l = i; i++; while (z >= 0) { list[*start][0] = 3; list[*start][1] = l; (*start)++; z--; l--; } } } else { i++; } } }:confused:Have a nice life!!
Looks some kind of sort method to me :P
-
:confused:
void set_ptList(int len, int *start) { int i, z, l; i = 0; z = 0; while (i < len) { if (new_settings[3][i] != act_settings[3][i]) { if (i < (len-1)) { if (new_settings[3][i] > act_settings[3][i+1]) { i++; z++; } else { for (l = i; l >= i-z; l--) { list[*start][0] = 3; list[*start][1] = l; (*start)++; } z = 0; i++; } } else { l = i; i++; while (z >= 0) { list[*start][0] = 3; list[*start][1] = l; (*start)++; z--; l--; } } } else { i++; } } }:confused:Have a nice life!!
-
:confused:
void set_ptList(int len, int *start) { int i, z, l; i = 0; z = 0; while (i < len) { if (new_settings[3][i] != act_settings[3][i]) { if (i < (len-1)) { if (new_settings[3][i] > act_settings[3][i+1]) { i++; z++; } else { for (l = i; l >= i-z; l--) { list[*start][0] = 3; list[*start][1] = l; (*start)++; } z = 0; i++; } } else { l = i; i++; while (z >= 0) { list[*start][0] = 3; list[*start][1] = l; (*start)++; z--; l--; } } } else { i++; } } }:confused:Have a nice life!!
It's a breath mint and a dish detergent.
-
:confused:
void set_ptList(int len, int *start) { int i, z, l; i = 0; z = 0; while (i < len) { if (new_settings[3][i] != act_settings[3][i]) { if (i < (len-1)) { if (new_settings[3][i] > act_settings[3][i+1]) { i++; z++; } else { for (l = i; l >= i-z; l--) { list[*start][0] = 3; list[*start][1] = l; (*start)++; } z = 0; i++; } } else { l = i; i++; while (z >= 0) { list[*start][0] = 3; list[*start][1] = l; (*start)++; z--; l--; } } } else { i++; } } }:confused:Have a nice life!!
-
:confused:
void set_ptList(int len, int *start) { int i, z, l; i = 0; z = 0; while (i < len) { if (new_settings[3][i] != act_settings[3][i]) { if (i < (len-1)) { if (new_settings[3][i] > act_settings[3][i+1]) { i++; z++; } else { for (l = i; l >= i-z; l--) { list[*start][0] = 3; list[*start][1] = l; (*start)++; } z = 0; i++; } } else { l = i; i++; while (z >= 0) { list[*start][0] = 3; list[*start][1] = l; (*start)++; z--; l--; } } } else { i++; } } }:confused:Have a nice life!!
It returns the number 42 and the question is "How many roads must a man walk down?"
Deja View - the feeling that you've seen this post before.
-
It returns the number 42 and the question is "How many roads must a man walk down?"
Deja View - the feeling that you've seen this post before.
Now thats a good one! Cheers
You have the thought that modern physics just relay on assumptions, that somehow depends on a smile of a cat, which isn’t there.( Albert Einstein)
-
:confused:
void set_ptList(int len, int *start) { int i, z, l; i = 0; z = 0; while (i < len) { if (new_settings[3][i] != act_settings[3][i]) { if (i < (len-1)) { if (new_settings[3][i] > act_settings[3][i+1]) { i++; z++; } else { for (l = i; l >= i-z; l--) { list[*start][0] = 3; list[*start][1] = l; (*start)++; } z = 0; i++; } } else { l = i; i++; while (z >= 0) { list[*start][0] = 3; list[*start][1] = l; (*start)++; z--; l--; } } } else { i++; } } }:confused:Have a nice life!!
-
:confused:
void set_ptList(int len, int *start) { int i, z, l; i = 0; z = 0; while (i < len) { if (new_settings[3][i] != act_settings[3][i]) { if (i < (len-1)) { if (new_settings[3][i] > act_settings[3][i+1]) { i++; z++; } else { for (l = i; l >= i-z; l--) { list[*start][0] = 3; list[*start][1] = l; (*start)++; } z = 0; i++; } } else { l = i; i++; while (z >= 0) { list[*start][0] = 3; list[*start][1] = l; (*start)++; z--; l--; } } } else { i++; } } }:confused:Have a nice life!!
First it missed a good indentation. ;)
Vasudevan Deepak Kumar Personal Homepage
Tech Gossips
A pessimist sees only the dark side of the clouds, and mopes; a philosopher sees both sides, and shrugs; an optimist doesn't see the clouds at all - he's walking on them. --Leonard Louis Levinson -
Apparently this code generates a list of reversed ordered blocks of indexes where the new_settings and acc_settings differ, separating the block in the items where the value in new_settings is > the next item in acc_settings. I guess...
-
It returns the number 42 and the question is "How many roads must a man walk down?"
Deja View - the feeling that you've seen this post before.
Awww shucks, now it happened again.
We are a big screwed up dysfunctional psychotic happy family - some more screwed up, others more happy, but everybody's psychotic joint venture definition of CP
My first real C# project | Linkify!|FoldWithUs! | sighist -
it shows there is no need for obfuscators in the modern toolbox. :laugh:
Luc Pattyn [Forum Guidelines] [My Articles]
this months tips: - before you ask a question here, search CodeProject, then Google - the quality and detail of your question reflects on the effectiveness of the help you are likely to get - use PRE tags to preserve formatting when showing multi-line code snippets
Quick n Easy Obfuscation! Search for the regular expression // {.*} and replace with nothing at all. (God help you if you use // anywhere in like, a file path).
Ninja (the Nerd)
Confused? You will be... -
:confused:
void set_ptList(int len, int *start) { int i, z, l; i = 0; z = 0; while (i < len) { if (new_settings[3][i] != act_settings[3][i]) { if (i < (len-1)) { if (new_settings[3][i] > act_settings[3][i+1]) { i++; z++; } else { for (l = i; l >= i-z; l--) { list[*start][0] = 3; list[*start][1] = l; (*start)++; } z = 0; i++; } } else { l = i; i++; while (z >= 0) { list[*start][0] = 3; list[*start][1] = l; (*start)++; z--; l--; } } } else { i++; } } }:confused:Have a nice life!!
-
Why? Is it something you need to figure out for work? Just a challenge for us? What's the concern? -Nick P.
About 4 years ago I had a problem with this code and spent a night trying to understand what the programmer wanted to do. It was just the worst code I have seen. Especially with parameter l and 1 is very difficult to tell apart...
Have a nice life!!
-
:confused:
void set_ptList(int len, int *start) { int i, z, l; i = 0; z = 0; while (i < len) { if (new_settings[3][i] != act_settings[3][i]) { if (i < (len-1)) { if (new_settings[3][i] > act_settings[3][i+1]) { i++; z++; } else { for (l = i; l >= i-z; l--) { list[*start][0] = 3; list[*start][1] = l; (*start)++; } z = 0; i++; } } else { l = i; i++; while (z >= 0) { list[*start][0] = 3; list[*start][1] = l; (*start)++; z--; l--; } } } else { i++; } } }:confused:Have a nice life!!
:omg: :wtf: That makes my head hurt!
WE ARE DYSLEXIC OF BORG. Refutance is systile. Your a$$ will be laminated.
-
:omg: :wtf: That makes my head hurt!
WE ARE DYSLEXIC OF BORG. Refutance is systile. Your a$$ will be laminated.
-
:) I wish I could claim it as my own original line, but I got it from my son. He found it somewhere online, and I loved it. :)
WE ARE DYSLEXIC OF BORG. Refutance is systile. Your a$$ will be laminated.
