Algorithm-in-Java | Implemented by Java | Learning library

I'm trying to calculate the shortest path in a graph stored in CouchDB. I have to do it 'in db' because my task is to compare query speeds in various situations for 3 different DBMSs. So loading the data and running dijkstra in python (or anything else) is not an option. I'm pretty new to document based databases so I may be wrong but as I see it my only option is a view.

My db structure is the following:

• One document represents one graph.
• In the document with a key 'edges' there is an array of objects with 3 properties: start, end, distance.
• start and end are node IDs but there is no other interesting information about nodes so they are not stored anywhere else.
• distance is a float

My idea was to create a view that returns the shortest path. I have this code for calculating it. It is based on this post. I just had to modify a bit otherwise I got syntax errors for stuff like let,foreach:

Note: This is only for personal use and learning, I am not trying to roll my own encryption for public use.

I need to AES256 encrypt a string, however my current attempts end up with a string like Salted__Vέ��|��l��ʼ8XCQlY server side when it is hex decoded. It should rather be a valid utf8 base64 string when hex-decoded, which can then be decoded to the original string. This is similar to the solution offered here, however the salt was not the actual problem (despite the answer being accepted) and I have not been able to suppress the salt op by hex decoding the iv before use (as it suggested). Is there a way to do this?

I've tried several different methods and always end up in a similar spot. My latest attempt is such:

encrypt.js

I would like to calculate the OTP password generated via Google Authenticator or similar app in C#.

I have found some Javascript implementations and Python but not for C#:

http://blog.tinisles.com/2011/10/google-authenticator-one-time-password-algorithm-in-javascript/

https://stackoverflow.com/a/8549884/3850405

Has anyone done this in C# or should I just try to convert the javascript code to C#?

Useful links:

https://tools.ietf.org/html/rfc6238

https://tools.ietf.org/id/draft-mraihi-totp-timebased-06.html

I'm writing a program in Python that implements a selection sort algorithm and sorts the elements of a list in descending order.

Let's say my input is l = [242, 18, 44, 201, 1111].

My logic is as follows:

• l = [242, 18, 44, 201, 1111] # switch l[0] (242) and l[len(l)-1] (1111)
• l = [1111, 18, 44, 201, 242] # switch l[1] (18) and l[len(l)-1] (242)
• l = [1111, 242, 44, 201, 18] # switch l[2] (44) and l[len(l)-2] (201)

The output would be [1111, 242, 201, 44, 18].

So, here's the code I'm implementing based on the above logic:

I need to get my google one-time password every time when I receive a new one.

Please check here also.

I want to use this code inside my app.js (in server side java script file). I have been trying to figure it out but could't make it.

I copied and pasted to all code in that website and created at under same directory and required it.

I tried this:

To all string manipulation maestros, this might be an interesting exercise. Given a string containing "x" or "xx" scattered in quasi-random places (like a DNA sequence), I need to permutate this string by varying the "x" in it. Each instance of "x" can be a singular "x" or a double "xx", and the entire string should contain all possible combinations of "x" and "xx".

Given the string "ooxooxoo", the output would be

In command line I can encrypt and decrypt my file with openssl as following:

Create Keys:

openssl req -x509 -newkey rsa:2048 -keyout myKey.key -out myKey.crt -pubkey

Encrypt:

cat myText.txt | openssl rsautl -encrypt -inkey myKey.crt -pubin >> encryptedtxt.enc

Decrypt:

openssl rsautl -decrypt -inkey myKey.key -in encryptedtxt.enc > decryptedtxt.txt

I followed the this tutorial

The goal is to find the sum of all primes up till num. I've seen the same implementation on another post, but it also doesn't work: Sieve of Eratosthenes algorithm in JavaScript running endless for large number

However, the solution there is also incorrect when I try it with 977, it returns 72179, but it should be 73156.

I'm trying to implement bresenham algorithm for a line here is what I did: