sparse(compact) Description: A sparse matrix is a 2D matrix that has many zeros. Assume that for storage efficiency someone has
converted a sparse matrix into a compact 2D matrix with dimensions Nx3 where N is the number of non-zero items in the original sparse matrix. In each row of compact, the first column holds the value of a non-zero item of the sparse matrix, the second column holds the row that this item resides in the sparse matrix, and the third column holds the column that this item resides in the sparse matrix. Write a function that given a compact matrix it returns the original sparse matrix. Assume the last row and the last column of the sparse matrix contain at least one non-zero item. Parameters: compact (list of list of int). Return value: a sparse list of list of int Example: sparse([[3,1,2],[4,5,3]]) → [ [0,0,0,0], [0,0,3,0], [0,0,0,0], [0,0,0,0], [0,0,0,0],
1 answer:
Answer:
Function sparse code is
def sparse(a):
rl = []
cl = []
for i in range(0,len(a)):
rl.append(a[i][1])
cl.append(a[i][2])
r = max(rl)
c = max(cl)
s = []
k = 0
for i in range(0,r+1):
s.append([])
for j in range(0,c+1):
if (i==a[k][1]) & (j == a[k][2]):
s[i].append(a[k][0])
k = k+1
else:
s[i].append(0)
return s
def main():
k = sparse([[3,1,2],[4,5,3]])
print(k)
if __name__ == '__main__':
main()
Explanation:
Please see attachment for output
You might be interested in
Answer:
Explanation:
The following code is written in Java. It creates 5 random integers and saves them to a list called myList. Then it loops through that list and checks each one until the largest and smallest values are obtained. Finally, it uses these values to calculate the sums and products as requested. The program has been tested and the output can be seen in the attached image below.
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Random;
import java.util.Scanner;
class Brainly {
public static void main(String[] args) {
Random rand = new Random();
ArrayList<Integer> myList = new ArrayList<>();
for (int i = 0; i< 5; i++) {
int mynum = rand.nextInt(20);
myList.add(mynum);
}
int largest = myList.get(0);
int smallest = myList.get(0);
int sum = 0;
int product = 1;
int sumLargestandSmallest, productLargestandSmallest;
for (int x : myList) {
if (x > largest) {
largest = x;
}
if (x < smallest) {
smallest = x;
}
sum += x;
product *= x;
}
sumLargestandSmallest = largest + smallest;
productLargestandSmallest = largest * smallest;
System.out.println("List" + Arrays.toString(myList.toArray()));
System.out.println("Smallest: " + smallest);
System.out.println("Largest: " + largest);
System.out.println("Sum: " + sum);
System.out.println("Product: " + product);
System.out.println("Sum of Smallest and Largest: " + sumLargestandSmallest);
System.out.println("Product of Smallest and Largest: " + productLargestandSmallest);
}
}
