value sorting chemo

                          #!/usr/bin/python
So I have a list of values, which need to be sorted in an arbitrary and static order. The input data sometimes drops a value or adds a new. Each datum is usually a 4-10 word string. Sometimes one word will get changed but is still the same value, so fuzzy matching must be used.

The output data needs to be in the same order everytime. Missing data filled with blank line, new data that's not in reference sort order appended to end.

A simple problem, I need to implement in python. Will come back to thread with code as I drink my coffee.

Do you own homework

It's not homewok, it's for a private ENTERPRISE

Just trying to get /prog/ to think about something programming related, rather than this cancer shit, which I don't even recognize.

Force the use _{(of indentation)}

Indent the use of force

So I have a list of values, which need to be sorted in an arbitrary and static order. The input data sometimes drops a value or adds a new.
Impossible, as the order is no longer static then.
Sometimes one word will get changed but is still the same value
Oh yeah, sometimes numbers change, but the value is still the same, right? Like, 1 can be 1 one time or 2 another time, depending on the position of the moon.
I need to implement in python.
How about indenting the data and hoping for the best?

[m]def python:[sub][sub]fioc = "lol fioc\n"[sub][sub]print fioc

[spoiler]EXPERT non-Structured EnglishFIOC user[/sub][/sub][/sub][/sub][/m]

>>7
FUCK MY LIFE

>>7,8
def python:_{fioc = "lol fioc\n"print fioc}

So you want to assign an increasing sequence number to each value and store them in an index that supports efficient lookups for whatever your equality criteria are?