Given a sorted array of integers and a number n, find a pair of numbers in the array whose sum is n.
Start with a pair constituted of the first and last numbers of the sorted array. At each step, compute the sum of the current pair. If the sum is larger than our objective, take following element as the first of our pair.
| #!/usr/bin/env bash | |
| # Dichotomic search in bash | |
| # This is a bash-specific function that uses bash features. | |
| # This is not guaranteed to work in other shells. | |
| # | |
| # Usage: | |
| # source dichotomic-bash.sh | |
| # result=$(dichotomic_search min max command) | |
| # | |
| # Returns the largest i for which `command i` succeeds (exits with a null exit code) |
| #!/usr/bin/env python3 | |
| # Replace text in a binary file, padding the replacement text with spaces | |
| import sys, locale | |
| if len(sys.argv) != 3: | |
| sys.stderr.write("Usage: %s string_from string_to < input.bin > output.bin.\n" % (sys.argv[0],)) | |
| sys.exit(1) | |
| codec = locale.getpreferredencoding() | |
| orig= bytes(sys.argv[1], codec) |
| {- OVERVIEW ------------------------------------------------------ | |
| A "Tree" represents a binary tree. A "Node" in a binary tree | |
| always has two children. A tree can also be "Empty". Below I have | |
| defined "Tree" and a number of useful functions. | |
| This example also includes some challenge problems! | |
| -----------------------------------------------------------------} |
| // Copyright (C) 2015 Dominic Charlesworth <[email protected]> | |
| // Author: Dominic Charlesworth <[email protected]> | |
| // This program is free software; you can redistribute it and/or | |
| // modify it under the terms of the GNU General Public License | |
| // as published by the Free Software Foundation; either version 3 | |
| // of the License, or (at your option) any later version. | |
| // This program is distributed in the hope that it will be useful, | |
| // but WITHOUT ANY WARRANTY; without even the implied warranty of | |
| // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
| // GNU General Public License for more details. |
| #!/usr/bin/env python3 | |
| """ | |
| Small module to flatten iterables | |
| """ | |
| def flatten(obj): | |
| """Flatten any nested iterables. | |
| >>> flatten([[1,2,[3]],4]) | |
| [1, 2, 3, 4] |
| function xpath(query) { | |
| var arr = []; | |
| var results = document.evaluate(query, document, null, XPathResult.ANY_TYPE, null ); | |
| while(r = results.iterateNext()) arr.push(r); | |
| return arr; | |
| } |
| import java.util.*; | |
| /* | |
| Дан целочисленный массив из 1001 элемента , | |
| все числа в массиве имеют пару и одно уникальное. | |
| найдите это число за O(n). | |
| */ | |
| class NotInPair { |
| <model description="Model 1" formatXmlVersion="2.0" id="{ed7a8cc7-38a3-4ca4-8373-751d7374bc9e}" shortName="Model 1"> | |
| <class id="{1f381b22-438a-4243-987c-51fdd36758a8}" shortName="Model 1"> | |
| <parameters /> | |
| <rules> | |
| <rule description="tk=0,5(tk1+tk2)" id="005516d4-2cbf-4e6d-9836-70c2e424e4a6" initId="b:cb01c927-966b-433a-a53a-30e6b9f5ba51;c:3e35e46f-c897-4376-93c9-d83d9910942e" relation="dbae2f6c-b823-4e27-9067-080feece5355" resultId="a:478c281f-8d74-48ac-87ed-cb57ed515049" shortName="tk(среднее значение времени обработки запроса в канале передачи данных)" /> | |
| <rule id="2cedfec1-9f66-4684-b84b-ab842827d4ce" initId="T0:7e954f2b-1ed2-4273-beeb-993a9f0e7d4c;Td:a4044004- |
| #!/usr/bin/env python3 | |
| import Levenshtein | |
| import scipy.optimize | |
| import subprocess | |
| import glob | |
| import sys | |
| p = subprocess.Popen(["tesseract", "--print-parameters"], stdout=subprocess.PIPE) | |
| args, _ = p.communicate() |
