I'm trying to run benchmark tests using AB.

I want to test the efficiency of languages against the quick sort algorithm.
Id appreciate anyone willing to help me test as I'm quite busy...


In Go I have :

package qsort

import "math/rand"

func QuickSort(slice []int) []int {
length := len(slice)

if length <= 1 {
sliceCopy := make([]int, length)
copy(sliceCopy, slice)
return sliceCopy
}

m := slice[rand.Intn(length)]

less := make([]int, 0, length)
middle := make([]int, 0, length)
more := make([]int, 0, length)

for _, item := range slice {
switch {
case item < m:
less = append(less, item)
case item == m:
middle = append(middle, item)
case item > m:
more = append(more, item)
}
}

less, more = QuickSort(less), QuickSort(more)

less = append(less, middle...)
less = append(less, more...)

return less
}

i would have written it in php but php is your primary language

DanielTheGeek:
I'm trying to run benchmark tests using AB.

I want to test the efficiency of languages against the quick sort algorithm.
Id appreciate anyone willing to help me test as I'm quite busy...


In Go I have :

try to alwalys embed ur code between "[code][/code]".

melodyogonna:

try to alwalys embed ur code between "[code][/code]".

Well, I know. It just seems to break things....

Where's your code solution?

Boss ur code is cool.

proxy20:
Boss ur code is cool.

Thanks, should I expect any implementation from you?

DanielTheGeek:


Thanks, should I expect any implementation from you?

Just here to learn you guys write quicksort in Java, js, c#,python, ruby,haskell,c++ or more

proxy20:


Just here to learn you guys write quicksort in Java, js, c#,python, ruby,haskell,c++ or more

Well the bosses seem to be asleep or have abandoned NL. Maybe I should follow because the reception of this thread is just discouraging...

DanielTheGeek:


Well the bosses seem to be asleep or have abandoned NL. Maybe I should follow because the reception of this thread is just discouraging...

Reception of almost every post on NL nowadays is discouraging, Many views ....trickling comments

DanielTheGeek:
I'm trying to run benchmark tests using AB.

I want to test the efficiency of languages against the quick sort algorithm.
Id appreciate anyone willing to help me test as I'm quite busy...


In Go I have :

C++
https://www.google.com/search?client=firefox-b&q=implementing+quicksort+in+C%2B%2B&oq=implementing+quicksort+in+C%2B%2B&gs_l=psy-ab.12..0i30k1.36302.44589.0.46624.15.14.0.0.0.0.896.1644.6-2.2.0....0...1.1.64.psy-ab..13.2.1642...0.0.fExOXEHt5Gg&gfe_rd=cr&dcr=0&ei=9QLpWYlhjNVe2Ym20AI

Java
https://www.google.com/search?q=quicksort+algorithm+Java&ie=utf-8&oe=utf-8&client=firefox-b&gfe_rd=cr&dcr=0&ei=XgPpWa6DF4zVXtmJttAC


C#
https://www.google.com/search?q=implementing+quicksort+in+C%23&ie=utf-8&oe=utf-8&client=firefox-b&gfe_rd=cr&dcr=0&ei=aQPpWab5HIzVXtmJttAC


Python
https://www.google.com/search?q=implementing+quicksort+in+python&ie=utf-8&oe=utf-8&client=firefox-b&gfe_rd=cr&dcr=0&ei=dwPpWeTQGIzVXtmJttAC