Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.
I want to find the 20th largest number for every 10x10 matrix in a total 1000x800 matrix. Seems that keep them in a sorted array is difficult. Is there any other ways?
So how can I store them in a sorted array? Assume that the array is empty at first and I store the first incoming number, how can I track the smallest number and replace it with a larger one? If the first smallest is replaced, how can I where is the second smallest one?
Hi all,
I met a problem and I can not come up with a solution. Hope someone can give me a hint.
Suppose there is a 1000x1000 matrix. The data come in one by one @ every clock cycle. (A00,A01,A02...A0999,A10...A999999). And I want to divide the 1000x1000 matrix to 100x100 small blocks, each...
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.
