we have a sequence of REAL numbers.all of the numbers are unique.we want to have an ascending sequence by changing some of these values.we are allowed to change any arbitrary numbers.how to find the optimum algorithm to determine the minimum number of necessary changes to make this sequence? we can use greedy or dynamic programming approach.
what is the greedy or dynamic programming approach of this?
144 views Asked by user3070752 At
1
There are 1 answers
Related Questions in ALGORITHM
- MCNP 6 - Doubts about cells
- Given partially sorted array of type x<y => first apperance of x comes before first of y, sort in average O(n)
- What is the algorithm behind math.gcd and why it is faster Euclidean algorithm?
- Purpose of last 2 while loops in the merge algorithm of merge sort sorting technique
- Dots and Boxes with apha-beta pruning
- What is the average and worst-case time complexity of my string searching algorithm?
- Building a School Schedule Generator
- TC problem 5-2:how to calculate the probability of the indicator random variable?
- LCA of a binary tree implemented in Python
- Identify the checksum algorithm
- Algorithm for finding a subset of nodes in a weighted connected graph such that the distance between any pair nodes are under a postive number?
- Creating an efficent and time-saving algorithm to find difference between greater than and lesser than combination
- Algorithm to find neighbours of point by distance with no repeats
- Asking code suggestions about data structure and algorithm
- Heap sort with multithreading
Related Questions in DYNAMIC-PROGRAMMING
- Leetcode 1255-recursion and backtracking
- Can dynamic programming help solve this problem?
- How to dynamically switch between two images onclick in Vue.js
- What boilerplate is the best for dynamic form building with reactjs typescript and .Net core microservices
- Is there a optimal solution for Jump Game Problem using C programming
- How to using Dapper to extract data from column dynamically altered table
- I'm facing a problem regarding hexagonal tiles
- 2 City Scheduling DP clarification
- How to find min cost for element selection from a sequence of adjacent pairs
- Dynamically Create Nested Structure
- Dynamic Dependency Injection at The Run Time
- Number of hits in fibonacci using lru_cache
- jit - "Failed in nopython mode pipeline" error, despite not using nopython in numba
- Issue solving DFS Flood Fill problem while iterating through branching options
- Discrepancy in Recursive and Memoized Knapsack Solution
Related Questions in GREEDY
- Assign visually distinct colors to graphs with undirected edges
- Finding the maximum concatenate number from the list of numbers provided
- Can this modified BLEU score problem be solved greedily?
- Time complexity of Rectangle Covering algorithm
- Can't solve optimization problem using greedy algorithm
- Why is the program NOT stuck in an infinite loop?
- Minimum Time to Perform One Task of Each Category (with Different Release Times)
- Handling Greedy Algorithm when meets with portal
- Criteria for being considered as a greedy algorithm in specific context
- How to select n columns from a matrix minimizing a given function
- skipping index 3 of items while inserting in map
- Can this be solved in O(n) time (leetcode - 561. Array Partition)?
- i have greedy and dijkstra algorithms with the same distance. My question is which distance to choose, B to C or B to D
- Maximise the Sum Difference in Rearranged array wrt to another array
- Greedy Algorithm returning incorrect answer for Job Sequencing Problem
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?
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)
first find longest increasing subsequence http://en.wikipedia.org/wiki/Longest_increasing_subsequence
then change all numbers which do not belong to this subsequence to fit the rule
(proof: if we change less numbers and acquire ascending sequence, then the numbers which were not changed were initially forming increasing subsequence longer then 'longest')