Write a code that compares Strassen’s Algorithms and ordinary multiplication. Include error handling. The output should compare the two algorithms (same output = True or false), each algorithm output should be included, and determine the number of matrix multiplication for each algorithm. Also, what' time and space complexity.

Write a code that compares Strassen’s Algorithms and ordinary multiplication. Include error handling. The output should compare the two algorithms (same output = True or false), each algorithm output should be included, and determine the number of matrix multiplication for each algorithm. Also, what' time and space complexity.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 9RQ

See similar textbooks

Similar questions

public static void WriteToFile(StreamWriter w, int[,] m) { // Write the elements of the "m" array in the matrix format // to the file "myFile.txt". // -------------------------------------- // Call the "AverageOfAllElements" method and // write the returned value after the text // "The average of all elements of the matrix:" in the file "myFile.txt". // -------------------------------------- // Put the header "LIST OF ODD NUMBERS IN EACH ROW:" in the file "myFile.txt". // Call the "WriteOddNumbersOfEachRow" method. // -------------------------------------- // Put the header "LIST OF EVEN NUMBERS IN EACH COLUMN" in the file "myFile.txt" // Call the "WriteEvenNumbersOfEachColumn" method. }
[Python (py3)] The code below can already solve for matrix addition. Please add the code for matrix scalar multiplication. The input will come from file1.txt, and the output should be printed to output.txt Format of the input from file1.txt:First Line: type of operation (add or scalmultiply)Second Line: matrix A dimension (example: if 3 rows and 2 columns, type 3 2)Third Line: matrix A elementsFourth Line: matrix B dimension (or the scalar number for the operation of scalar multiplication)Fifth Line: matrix B elements (not needed for scalar multiplication)Sample input 1:scalMultiply2 253 -47 312Sample output 1:106 -814 62 ---------------------------------------------------------------------------------- import numpy as npimport sys f1 = open("file1.txt","r")lines = f1.readlines()dim = lines[1].split()k=2mat1 = np.empty((0,int(dim[0])), int)for i in range(0,int(dim[0])): l = lines[k].split() l = list(map(int, l)) ls = np.array([l]) k += 1 mat1 = np.append(mat1, ls,…
can you write it in java.util.scanner form and can you make so i can copy and past it please, thank you. ☜ (ﾟヮﾟ☜) Simulate binary search Use array {1, 2, 3, 4, 5, 6, 7} to simulate binary search of 3. For each iteration, you need to write down the value of first, last, and middle after the execution of this statement: middle = (first + last) / 2 follow the loop until you get the search result. After you are done, update the BinarySearchDemo.java class to use this array for search. Compare the print out result to your simulation result.
Declare two characters array And take input from user in first array and at last index take slach zero (/0) similarly we take input in second array and at end /0. And take another array and copy first array in this blank array and when we come to /0 then copy second array in blank array. Example First array (this is a) Second array (book) Blank array (this is a book) Don't use built-in functions
java programming language note the corrupted matrix must be read from a txt file in java and make a read file method to read it and replace the * with the average of the column. it should work in any NxM matrice (2D array) please take your time I am not in a hurry. thank you for the help :)
Programming language: C/C++, Java, Python, or any other advanced programming languages Project Description: the file “IntegerArray.txt” included in this project folder contains all the 100,000 integers between 1 and 100,000 (inclusive) in some order, with no integer repeated. Your task is to compute the number of inversions in the file given, where the i-th row of the file indicates the i-th entry of an array. Because of the large size of this array, you should implement a divide-and-conquer algorithm.
Write the following program in JAVA A magic square is an n x n matrix which, if filled with numbers, the sum of the elements in each row, each column, and the two diagonal is the same value. Write a program that asks the user to for the size of an n x n matrix (square), stores the values in a two dimensional array and prints whether the values entered form a magic square.The program must use methods, loops and two dimensional arrays for this assignment. The main method should show the flow of the program as discussed in class.Sample Run 1:Enter the size of the square3Enter the numbers in each row separated by a space11 1 11 1 11 1|1 1 1 | |1 1 1 | |1 1 1 |Magic SquareSample Run 2:Enter the size of the square4Enter the numbers in each row separated by a space111 1 121 1 111 1 111 1|1 1 1 1 | |1 2 1 1 | |1 1 1 1 | |1 1 1 1 |Not a Magic SquarePlease note: The name
Javascript Write the function popAndShift(). The function has to first print the the contents of the arrays array1 and array2. After this, the elements of array2 will be deleted, alternating between the .pop() and .shift() methods (starting with .pop()), while adding the removed values to the end of array1. Finally, the contents of array1 will be printed. Note! Example output: First array: first,second Second array: third,fourth Resulting array: first,second,fourth,third The verification of program output does not account for whitespace characters like "\n", "\t" and " "
CODE IN JAVA design a program that grades arithmetic quizzes as follows: (Use the below startup code for Quizzes.java and provide code as indicated by the comments) 1. Ask the user how many questions are in the quiz. 2. Use a for loop to load the array. Ask the user to enter the key (that is, the correct answers). There should be one answer for each question in the quiz, and each answer should be an integer. They can be entered on a single line, e.g., 34, 7, 13, 100, 8 might be the key for a 5-question quiz. You will need to store the key in an array called "key". 3. Ask the user to enter the student's answers for the quiz to be graded. There needs to be one answer for each question. Note that each answer can simply be compared to the key as it is entered. If the answer is correct, add 1 to a correct answer counter. need this in a separate for loop from the loop used to load the array. 4. When the user has entered all of the answers to be graded, print the number correct…
Create two dynamic arrays A and B with random numbers.a) Merge B in array A calling a function by reference.b) Delete the Prime numbers from the merged array A calling a function by pointer.c) Print the Array A in ascending order.You have to use only two Arrays A and B throughout the code. Be carefulabout memory leakage.Example:A= [20, 30, 5, 7, 19]B= [19, 10, 15, 11, 17, 25] a) After merging B in A, the merged Array A will look like-A= [20, 30, 5, 7, 19, 19, 10, 15, 11, 17, 25] b) After deleting prime numbers the merged Array would look like-A= [20, 30, 10, 15, 25] c) Finally print the merged array in ascending orderA= [10, 15, 20, 30, 25] In C++ Please
def large_position(matrix: list[list[int]], row: int, col: int) -> int: """ Returns the area of the largest rectangle whose top left corner is at position <row>, <col> in <matrix>. You MUST make use of the helper <longest_chain> here as you loop through each row of the matrix. Do not modify (i.e., mutate) the input matrix. >>> case = [[1, 0, 1, 0, 0], ... [1, 0, 1, 1, 1], ... [1, 1, 1, 1, 1], ... [1, 0, 0, 1, 0]] >>> large_position(case1, 0, 0) 4 """ You must refer to this while writing for the code above Helper: def longest_chain(lst: List[int]) -> int: count = 0 i = 0while (i < len(lst) and lst[i] != 0): i += 1 count += 1 return count """ Please do this on python you should not use any of the following: dictionaries or dictionary methods try-except break and continue statements recursion map / filter import ""'
3. Please create a program in Java that will read through a file of 25 words(one of them being Waldo) and will store them in an array. The program should have two types of search (sequential and binary search). Use .equals() to find Waldo and System.nanoTime to find the time it took each of the methods to find Waldo. After that, print both times and in a separate line print which method was the fastest.