Reply to thread

Message

<blockquote data-quote="Mikee" data-source="post: 417501" data-attributes="member: 76567">I don't have an answer for you but I definitely don't recommend loading it from furnidata UNLESS the furnidata is sorted. Because if you did keep it sorted then you could do a bisection search and pull item data that way, which in return WOULD be a good idea. (But once again the data NEEDS to be sorted)Why would a sorted furnidata with item data be a good chocie IF sorted?A bisection sort has a complexity of O(Logn), While a database lookup has a complexitiy of O(n) therefore a bisection search aka pulling itemdata from furnidata file would be faster (IF SORTED!!).Why do i emphasize sortment?Because its expensive.You'd need to sort the data once and keep it sorted or else it'll be a mess.If you sort it each time you run a bisection sort it'll&nbsp; be more expensive than a db lookup.So sort it once, keep it sorted, and its a great idea.</blockquote>

[QUOTE="Mikee, post: 417501, member: 76567"] I don't have an answer for you but I definitely don't recommend loading it from furnidata UNLESS the furnidata is sorted. Because if you did keep it sorted then you could do a bisection search and pull item data that way, which in return WOULD be a good idea. (But once again the data NEEDS to be sorted) Why would a sorted furnidata with item data be a good chocie IF sorted? A bisection sort has a complexity of O(Logn), While a database lookup has a complexitiy of O(n) therefore a bisection search aka pulling itemdata from furnidata file would be faster (IF SORTED!!). Why do i emphasize sortment? Because its expensive. You'd need to sort the data once and keep it sorted or else it'll be a mess. If you sort it each time you run a bisection sort it'll be more expensive than a db lookup. So sort it once, keep it sorted, and its a great idea. [/QUOTE]

Verification

Reply to thread

Connect with us

Newest members