About: http://webisa.webdatacommons.org/9511978

Property	Value
http://www.w3.org/1999/02/22-rdf-syntax-ns#type	http://www.w3.org/ns/prov#Entity
http://www.w3.org/ns/prov#value	On the other hand, there are examples of sorting algorithms that operate using $O(n\log n)$ comparisons (e.g., merge sort), giving an upper bound.
http://www.w3.org/ns/prov#wasQuotedFrom	stackexchange.com