Nimo
Guest
|
 Posted: Mon Oct 27, 2008 6:13 am Post subject: New Algorithm |
 |
|
For the last 20 days trying very hard to come with very new
Method just landed here. Let us see
110100001001000011111101001000
Assume A= 101010101010..........10(n)
& (A bar) =010101010101..........01(n)
Step1:- divide given string to pairs
11 01 00 00 10 01 00 00 11 11 11 01 00 10 00
-----------------------------------------------------------------
Step2:-11=0,00=0
1 01 0 0 10 01 0 0 1 1 1 01 0 10 0
-----------------------------------------------------------------
Step3:-merge it
1010010 0100111010100
----------------------------------------------------------------
Step4:-again divide in to pairs
10 10 01 00 10 01 11 01 01 00
---------------------------------------------------------------
Step5:- 11=0,00=0
10 10 01 0 10 01 1 01 01 0
--------------------------------------------------------------
Step6:-merge it
10100101001101010
-------------------------------------------------------------
Step7:-again pairs
10 10 01 01 00 11 01 01 0
here left out with single zero, write it as it is
--------------------------------------------------------------
Step8:-
10 10 01 01 0 1 01 01 0
--------------------------------------------------------------
Step9:-merging and pairing
101001010101010
10 10---01 01 01 01 01----0
2(As),4(A bars) and a 0.
Falsification test:-Only works with 0 and 1 but not
With this type of strings aaaabbbacaaacc100111010aa.
Can you please review it or comment it or correct me.
Thanks.
My dream is 100MB=250-500KB. |
|
