Good evening,
Well I've looked through the program and I've fixed the array subscript issue, but I have another issue. Here's how my code looks now
Program heapsort
Implicit None
integer, parameter:: column = 2
integer, parameter:: n = 6
integer :: i, j, status...
Good evening,
I'm currently writing a program that uses the heapsort algorithm to sort a very large two-dimensional array. However, I'm having problems with the program.
What I'm attempting to do is to sort the second column of a two dimensional array. So for instance, suppose that I sort this...
Here's how my initial code looks. My biggest problem is that I'm not sure how to put all of my values into "temp" and place them into a 2-D array correctly. One thought on correcting this would be to use two different arrays instead. Any suggestions?
program sort
real :: temp
integer :: row =...
Hi,
I have a question regarding use of a sorting algorithm. Suppose I have a file as follows:
103 32
329 45
340 24
334 43
452 40
What I would like to do is sort each row in ascending order based on the second column value. So if I wanted to sort this, I would have
340 24
103 32
452 40
334 43...
Good Afternoon,
I would like to know if there is a standard procedure to create a random number generator. In my program, I have a text file that looks something like this:
10012.3 343 23 193 EP 32 49 PO 32 ...
...
...
where this has at most 20 columns and an indefinite number of rows. What I...
Hello again, I have another question
Consider the same type of text file
19.9 4473.5 0.601 0.562 26495.581 0.554 46652.1 86 32
20.1 3332.3 0.602 0.232 232943.439203 0.23 134.1 34 56
84.24 442034.5 0.124 0.321 304202.323 0.32 0.00324 392030
...
...
This has an unknown number of rows with an...
Good afternoon,
I have a question regarding reading from a text file. Suppose that I have a text file that looks like:
10003 343 0.04 1213 ES1(10-1) 3454 34
10024 342 0.93 1212 ES2(9-2) 3452 34 245 34
10032 331 1.44 1880 MT1(7-6) 2323 21 354 111 345
...
...
...
This text file can go up to...
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.