| Title | Searching Arrays (Case 3) |
| Catalog Type | SLCItem |
| Persistent ID | https://pawscomp2.sis.pitt.edu/pcex/pcex_v2/index.html?lang=JAVA&set=arrays.j_search_array&ch=JSearchArrayCountsEach |
| Platform Name | PCEX |
| Features | — |
| Description | Construct a program that has a function that receives two arrays and creates an array that contains the number of times each element in the 2nd array appears in the 1st array. For example, if the 1st array is {1, 2, 3, 3, 4, 4, 5, 6} and the 2nd array is {3, 4, 5, 6, 7}, then the array that contains the number of times each element in the 2nd array appears in the 1st array is {2, 2, 1, 1, 0}.\nAssume that all elements in the 2nd array are unique. |
| Keywords | arrays |
| Author | Roya Hosseini |
| Institution | University of Pittsburgh |
| Iframe URL | https://pawscomp2.sis.pitt.edu/pcex/pcex_v2/index.html?lang=JAVA&set=arrays.j_search_array&ch=JSearchArrayCountsEach |
| Protocol | PITT, HTML |
| Protocol URL | |
| License | MIT |
| Programming Language | Java |
| Natural Language | en |