Algorithm New Question

what is the proper method to recognize patterns, e
Consider that Now I have a list 'A' which has 100 elements and each elements is also a list 'a' whose elements is number but its length is variational (such as 20 numbers, 30 numbers, 5 numbers and so ...... 
Multiple Securities Trading Algorithm
I am very new to Python and I am having trouble executing my algorithmic trading strategy on more than one security at a time. I am currently using these lines of code for the stocks:data_p = pd....... 
Building a mask out of a selection of days of week
Given a selection of days of week, I need to know whether a specific day is matching the selection.For example, given:enum DayOfWeek { MON, TUE, WED, THU, FRI, SAT, SUN}And the following ...... 
Create a kary tree from a list of coordinates and
I have a list of Nodes/Vertices, and a list of lines/edges connecting these nodes.The lists are not sorted or ordered in any way, but contain all the edges and nodes for a particular data set. The ...... 
Why heapsort time complexity is given in BigOh(N
Why in CLRS book time complexity of heapsort is specifically given as Ο(N log N) while all other algorithms are in Θ notation? I am feeling like I am missing something from the intuition.Here is ...... 
O(n^2) calculation assistance needed
I just can't seem to figure this one out: 5n2 + 3n + 9 = O(n2). Pick c and n0. Prove using f(n) <= c.g(n).I have tried compressing it into 3n + 9 / c  5 <= n^2, but I am still unable to find ...... 
How to iterate over the digits of a number in MIPS
I have a task where I need to take a number, e.g. 13002, and print it digit by digit using UART (including nonleading 0's). The UART expects that whatever it prints will go in the $s0 register but I ...... 
can some write a divide and conqure approch for so
Given a Binary Tree, find size of the Largest Independent Set(LIS) in it. A subset of all tree nodes is an independent set if there is no edge between any two nodes of the subset.I know there ...... 
How do I construct an efficient algorithm for find
Given a undirected weighted graph with n vertices and m edges. How do I construct an algorithm which takes at most O((n+m) log(n+m)) for finding the vertex which it's min shortest path distance to a ...... 
Find the two numbers that appear only once  divid
Given an array in which each element appears twice, I have to find which two numbers of the array appear only once. Maximum additional memory is O(1).I have found this amazing solution: https://...... 
Defective chessboard problem  looking for pseudoc
I should use the divideandconquer paradigm to design a recursive algorithm "CBCover", which determines a coverage (as seen in the image below) in runtime O(n^2) (n = 2^k).The entry/ input of ...... 
A question regarding the tower of hanoi recursive
I am doing a coding exercise today. After finishing the examination, I checked the results and I faced a problem whose problem statement is shown as follows:Given 4 disks in the tower of Hanoi ...... 
What is the complexity of T(n) = T(3n/4) + 2T(n/2)
I have had trouble solving the problem. I figured out that at last, what will be the answer.... 
Counting inversions in an array of 2D pair
Problem Description:Let there be an array of 2D pairs ((x1, y1), . . . ,(xn, yn)). With a fixed constanty' a pair (i, j) is called halfinverted if i < j, xi > xj , and yi ≥ y' > yj . ...... 
shortest path going through m edges
Hello there smart people.I have a following graph problem.Given a complete, directed, wieghted graph with n vertices, find the length of the shortest path (starting at any vertex) going through m  ......