Re: Arrange them [ updated ]

Cobra Wrote:

No, not encryption methods, but compression technique.

Wow, your algorithm is great,

now lets see you arranged some thing
like this 11000011110111 into
10 10 10 .....

its fine, now we can write it as n(10)
say,if n = 5
i.e 10 10 10

with this again "trying" to 'reproduce'

original 11000011110111


some of the members are saying it's impossible
and waste of time.
But I'm strongly believing that there are certain
'definite' steps which on moving them 'to and fro'
it is possible to do that

Thanks.
for your program.

You are welcome!

What I did with this program was just recreate A$ (string) while X and X1 were being built.

What you want is to delete A$ @ line 100 without leaving
any record of A$ and rebuild A$ from the newly grouped
pairs and singles created from X and X1.

How is that possible? It will never happen!

You have to save something from the original order
where what you save may not be the original string but
some sort of fancy path record of the original string.

Putting some kind of identifier attached to each value
of X and each value of X1 would do it, but why bother.


Dan
.