50 lines
1.0 KiB
C++
50 lines
1.0 KiB
C++
#include <iostream>
|
|
|
|
#include "practice2.cpp"
|
|
|
|
|
|
int main()
|
|
{
|
|
// 1.1
|
|
// int *length = new int(10);
|
|
// int array[100] = {0, 2, 3, 4, 7, 8, 10, 13, 15, 20};
|
|
|
|
// int numToSearch;
|
|
//
|
|
// std::cout << "Find: "; std::cin >> numToSearch;
|
|
// std::cout << binarySearchWithInsert(array, length, numToSearch) << std::endl;
|
|
|
|
// for (int i=0; i<*length; i++)
|
|
// {
|
|
// std::printf("%d, ", array[i]);
|
|
// }
|
|
// std:: cout << std::endl;
|
|
|
|
// return 0;
|
|
|
|
// 1.2
|
|
// int array[] = {0, 1, 2, 3, 4, 6, 4, 3, 2, 3, 4, 2};
|
|
// int length = sizeof(array) / sizeof(array[0]);
|
|
|
|
// std::cout << isMountain(array, length) << std::endl;
|
|
|
|
// 1.3
|
|
// int array[] = {-1, -1, -1, 3};
|
|
// int length = sizeof(array) / sizeof(array[0]);
|
|
// std::cout << whichIsMore(array, length) << std::endl;
|
|
|
|
// 1.4
|
|
int array[] = {5,2,6,1};
|
|
int length = sizeof(array) / sizeof(array[0]);
|
|
|
|
int* counts = countsFromNums(array, length);
|
|
|
|
for (int i=0; i<length; i++)
|
|
{
|
|
std::printf("%d, ", counts[i]);
|
|
}
|
|
std:: cout << std::endl;
|
|
|
|
return 0;
|
|
}
|