-
[
C/C++]
addition3.rar
divide and conquer method of assigning one processor to each node in a tree for adding numbers (Lecture 6 Chapter 4 section 4.1.2) in terms of communication, computation, overall parallel execution time, speedup, and efficiency.
-
-
-
-
-
[
Java/JSP]
resueltas.rar
Java examples for dinamic programming, divide and conquer, greedy algorithms and backtracking.
-
-
[
C/C++]
mergeSort.rar
merge sort is a sorting algorithm used for sorting data
it uses divide and conquer approach
-
[
C/C++]
HW1.rar
in this code we do the multiplication with divide and conquer method. it can be known dynamic programming
Category:
SCM Upload User:
cartermai Size:
11K
-