Python: Removing Same Elements in a List Without Sorting It

This has the exact same idea with the earlier JavaScript post with almost the same title.
In this, I "translated" the JavaScript language into Python language.

Python

#result flag def check(b, f): for i, val_ref in enumerate(b): for j, val in enumerate(b): if (i < j and val == val_ref): f = 0 #same elements found break return f #this will return either 1 or 0 #main deleter def r_d(a): l = len(a) #array length b = a[0:l] #copy array flag = 1 #initialize flag for i, val_ref in enumerate(b): for j, val in enumerate(b): if (i < j and val == val_ref): del b[j] if (0 == check(b, flag)): b = r_d(b) #re-invoke this function return b original_ar = [0, 1, 2, 3, "meh", "strontium", "meh", 3, 5, 55, 30, 201, "zebra", "meh", "zebra", 0, 2, 3, 2, 3, 100, 55, 30, 30, 20, 0, 0, "strontium"] filtered_ar = r_d(original_ar) print filtered_ar #output

Added shorter version April 22, 2015

Shorter version

def r_d(a): b = a[0:len(a)] #copy array buffer = [] dummy = "deleted" #dummy string for i, val_ref in enumerate(b): for j, val in enumerate(b): if (i < j and val == val_ref): b[j] = dummy for k in xrange(0, len(b)): if str(b[k]) != dummy: buffer += [b[k]] #push element return buffer

---

#1 Result in Python's command terminal (1^st version)

#2 Result in Python's command terminal (shorter version)

This will leave the original array (list) intact, no changes.