What would be the best way to arrange a sequence of numbers such that the sum of any two adjacent number is a prime number E.g.: 7,6,5,2,1,4,3 is one such sequence for numbers between 1 to 7.
arrange sequence of numbers such that sum of adjacent number is a prime number
2.5k Views Asked by Hemal At
1
There are 1 best solutions below
Related Questions in ALGORITHM
- Two different numbers in an array which their sum equals to a given value
- Given two arrays of positive numbers, re-arrange them to form a resulting array, resulting array contains the elements in the same given sequence
- Time complexity of the algorithm?
- Find a MST in O(V+E) Time in a Graph
- Why k and l for LSH used for approximate nearest neighbours?
- How to count the number of ways of choosing of k equal substrings from a List L(the list of All Substrings)
- Issues with reversing the linkedlist
- Finding first non-repeating number in integer array
- Finding average of an array
- How to check for duplicates with less time in a list over 9000 elements by python
- How to pick a number based on probability?
- Insertion Sort help in javascript -- Khan Academy
- Developing a Checkers (Draughts) engine, how to begin?
- Can Bellman-Ford algorithm be used to find shorthest path on a graph with only positive edges?
- What is the function for the KMP Failure Algorithm?
Related Questions in STL-ALGORITHM
- sorting elements in a vector of curves
- Iterating over a vector with std::adjacent_find and custom predicate
- position comparing two strings
- std set insert and union efficient way
- How do I get out of this do-while loop?
- Binary search equivalent for `find_if`
- Run two <algorithm>s side by side on the same input iterator range
- What would be the bast way to insert and remove elements of a vector by iterating from the end
- Improvements to search algorithm
- <algorithm> sort custom condition
- Need to understand std::remove with vector.erase
- Avoid manual creation of lambda to wrap the call to new[]: to be used as a generator function in std::generate
- Are fill_n and fill the same function but with different parameter overloads?
- Does std::copy_n work with overlapping ranges?
- arrange sequence of numbers such that sum of adjacent number is a prime number
Related Questions in EVOLUTIONARY-ALGORITHM
- Why is there only one hidden layer in a neural network?
- Genetic Algorithm - Order of variables in a chromosome
- What are the benefits of Gray code in evolutionary computation?
- Can standard representation trees in genetic programming (GP) contain operators such as if then?
- Simple GA very fast convergence
- Suggestions to implement a DFA to classify binary strings with a genetic algorithms strategy
- Enforce constraints in genetic algorithm with DEAP
- All versions of differential evolution algorithm
- Converting an evolutionary algorithm to genetic
- Genetic/Evolutionary algorithm - Painter
- How to implement an asynchronous parallel genetic algorithm using the MATLAB Parallel Computing Toolbox?
- What is the Difference between evolutionary computing and classification?
- Equality constrainsts handling in Evolutionary multiobjective algorithms
- how to run evolutionary algorithms using pyspark
- Genetic Algorithm Tournament Selection
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
As far as I see it, the easiest way to tackle this problem is to break it into two parts that are more well defined:
Generate an undirected graph, so that each vertex is a number in this list of numbers and each edge links a pair of numbers that can be adjacent. Or in other words, generates a graph that connects any two numbers that has a prime number sum. This can be done in quite a straightforward manner by looping through 2 indices.
Find a Hamiltonian path for the aforementioned graph. That is the sequence you want. This is somewhat a well-studied problem and a number of algorithms exist. You just need to pick one and there might be a native implementation in software like Mathematica. This would be even faster than O(n^2).
Of course you can find multiple ways to speed up the first step, if you know a bit more about what kind of list of numbers you are dealing with.