Site Tools


Differences

This shows you the differences between two versions of the page.

Link to this comparison view

developer:quicksortkeyvaluepair [2015/09/14]
127.0.0.1 external edit
developer:quicksortkeyvaluepair [2016/01/25] (current)
sandy
Line 1: Line 1:
-====== Key-Value ​pair QuickSort ​algorithm ​======+====== Key-Value ​Pair QuickSort ​Algorithm ​======
 > **Developer:​** //​[[developer:​rhinoscript|RhinoScript]]//​ > **Developer:​** //​[[developer:​rhinoscript|RhinoScript]]//​
 > **Summary:​** //How to sort multiple arrays using a Key list.// > **Summary:​** //How to sort multiple arrays using a Key list.//
Line 7: Line 7:
  
 =====Answer===== =====Answer=====
-VBScript and [[developer:​rhinoscript|RhinoScript]] do not expose procedures for sorting multiple arrays. The DotNET framework does, but only a single Key-Value pair. The algorithm outlined on this page can be easily extended to work for any number of value arrays. It is a standard implementation of the [[http://​en.wikipedia.org/​wiki/​Quicksort|QuickSort]] algorithm.+VBScript and [[developer:​rhinoscript|RhinoScript]] do not expose procedures for sorting multiple arrays. The DotNET framework does, but only a single Key-Value pair. The algorithm outlined on this page can be easily extended to work for any number of value arrays. It is a standard implementation of the [[http://​en.wikipedia.org/​wiki/​Quicksort|Quicksort]] algorithm.
  
-QuickSort ​works through a [[http://​en.wikipedia.org/​wiki/​Divide_and_conquer_algorithm|Divide ​and Conquor]] approach and it's one of the fastest sorting algorithms available. However, this implementation uses the recursive approach which may result in Stack Overflow errors on large datasets. ​QuickSort ​works best on randomized arrays, if the array is already almost sorted the solution will take more steps.+Quicksort ​works through a [[http://​en.wikipedia.org/​wiki/​Divide_and_conquer_algorithm|divide ​and conquor]] approach and it's one of the fastest sorting algorithms available. However, this implementation uses the recursive approach which may result in Stack Overflow errors on large datasets. ​Quicksort ​works best on randomized arrays. If the array is already almost sorted the solution will take more steps.
  
 This implementation comes as a collection of three procedures, but it can be easily packaged into one. This implementation comes as a collection of three procedures, but it can be easily packaged into one.
developer/quicksortkeyvaluepair.txt ยท Last modified: 2016/01/25 by sandy