{"id":129,"date":"2017-11-13T16:21:48","date_gmt":"2017-11-13T16:21:48","guid":{"rendered":"http:\/\/eipsoftware.com\/musings\/?p=129"},"modified":"2018-02-01T16:44:06","modified_gmt":"2018-02-01T16:44:06","slug":"pairwise-product","status":"publish","type":"post","link":"https:\/\/eipsoftware.com\/musings\/pairwise-product\/","title":{"rendered":"Pairwise Product"},"content":{"rendered":"<p>Function to take a vector of length n and multiply the two largest values in the vector.<\/p>\n<p>See the code below<\/p>\n<p><!--more--><\/p>\n<pre class=\"theme:github width:700 lang:python decode:true\"># Uses python3\r\n\r\n# function to take a vector of length n and multiply the two largest values\r\n# in the vector\r\n#' @param lenVector integer showing count of how large the vector firstIndex\r\n#' @param vectorNumbers vector of integer numbers between 0 and 100000\r\n#' @return integer product of two largest values in the vector\r\n\r\ndef max_pair(lenVector, vectorNumbers):\r\n    max_index = -1\r\n    for firstIndex in range(0, lenVector):\r\n        if max_index == -1 or vectorNumbers[firstIndex] &gt; vectorNumbers[max_index]:\r\n            max_index = firstIndex\r\n\r\n    max_index_2 = -1\r\n    for secondIndex in range(0, lenVector):\r\n        if secondIndex != max_index and (max_index_2 == -1 or vectorNumbers[secondIndex] &gt; vectorNumbers[max_index_2]):\r\n            max_index_2 = secondIndex\r\n\r\n    return(vectorNumbers[max_index] * vectorNumbers[max_index_2])\r\n\r\n#input from the user\r\nn = int(input())\r\nvectorNumbers = [int(x) for x in input().split()]\r\n\r\n#make sure that the length of vector is same as first value entered by user\r\nassert(len(vectorNumbers) == n)\r\n\r\n# out put the results\r\nprint(max_pair(n, vectorNumbers))<\/pre>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Function to take a vector of length n and multiply the two largest values in the vector. See the code below<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_crdt_document":"","footnotes":""},"categories":[3,4],"tags":[28,29],"series":[],"class_list":["post-129","post","type-post","status-publish","format-standard","hentry","category-python","category-code","tag-python","tag-pairwise"],"_links":{"self":[{"href":"https:\/\/eipsoftware.com\/musings\/wp-json\/wp\/v2\/posts\/129","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/eipsoftware.com\/musings\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/eipsoftware.com\/musings\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/eipsoftware.com\/musings\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/eipsoftware.com\/musings\/wp-json\/wp\/v2\/comments?post=129"}],"version-history":[{"count":4,"href":"https:\/\/eipsoftware.com\/musings\/wp-json\/wp\/v2\/posts\/129\/revisions"}],"predecessor-version":[{"id":143,"href":"https:\/\/eipsoftware.com\/musings\/wp-json\/wp\/v2\/posts\/129\/revisions\/143"}],"wp:attachment":[{"href":"https:\/\/eipsoftware.com\/musings\/wp-json\/wp\/v2\/media?parent=129"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/eipsoftware.com\/musings\/wp-json\/wp\/v2\/categories?post=129"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/eipsoftware.com\/musings\/wp-json\/wp\/v2\/tags?post=129"},{"taxonomy":"series","embeddable":true,"href":"https:\/\/eipsoftware.com\/musings\/wp-json\/wp\/v2\/series?post=129"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}