This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// Task sheet | |
// Utils | |
function log(data){ | |
Logger.log(data) | |
} | |
function getIndexOfA1Notation(sheet, notation) { | |
var notationRange = sheet.getRange(notation) // get range of notation | |
return notationRange.getRowIndex() // get row index | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
if number > int(biggest) { | |
if biggest > secondBiggest { | |
secondBiggest = biggest | |
} | |
biggest = float64(number) | |
} else { | |
if number > int(secondBiggest) { | |
secondBiggest = float64(number) | |
} | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
if number > biggest: | |
if biggest > second_biggest: | |
second_biggest = biggest | |
biggest = number | |
else: | |
if number > second_biggest: | |
second_biggest = number | |
return biggest * second_biggest |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
if number > int(biggest) { | |
biggest = float64(number) | |
fmt.Printf("Biggest value: %.0f\n", biggest) | |
} else { | |
if number > int(secondBiggest) { | |
secondBiggest = float64(number) | |
fmt.Printf("Second Biggest value: %.0f\n", secondBiggest) | |
} | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
if number > biggest: | |
biggest = number | |
print(f'Biggest value: {biggest}') | |
else: | |
if number > second_biggest: | |
second_biggest = number | |
print(f'Second Biggest value: {second_biggest}') |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
func main() { | |
for { | |
n := rand.Intn(1000) | |
values := rand.Perm(n) | |
start_common := time.Now() | |
max := maxPairwiseProduct(values[:]) | |
elapsed_max := time.Since(start_common).Nanoseconds() | |
start_faster := time.Now() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
if __name__ == '__main__': | |
while(True): | |
n = random.randint(1,1000) | |
values = [int(num) for num in range(n)] | |
start_common = time.process_time_ns() | |
max_common_return = max_pairwise_product(values) | |
elapsed_common = (time.process_time_ns() - start_common) | |
start_faster = time.process_time_ns() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def max_pairwise_product_faster(numbers): | |
n = len(numbers) | |
biggest = 0 | |
second_biggest = 0 | |
for number in range (n): | |
if number > biggest: | |
biggest = number | |
else: | |
if number > second_biggest: | |
second_biggest = number |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
func maxPairwiseProductFaster(numbers []int) float64 { | |
biggest := 0.0 | |
secondBiggest := 0.0 | |
for _, number := range numbers { | |
if number > int(biggest) { | |
biggest = float64(number) | |
} else { | |
if number > int(secondBiggest) { | |
secondBiggest = float64(number) | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
func maxPairwiseProduct(numbers []int) float64 { | |
n := len(numbers) | |
maxProduct := 0.0 | |
for first, _ := range numbers { | |
for second := first + 1; second < n; second++ { | |
maxProduct = math.Max(float64(maxProduct), | |
float64(numbers[first]*numbers[second])) | |
} | |
} | |
return maxProduct |
NewerOlder