Sort and Search Algorithms
Great work overall implementing these algorithms! I really liked that you extracted some of the common pieces into methods, and even a header file! Also it's great that you're attempting these algorithms on your own, before looking at standard implementations.

For the Bubble Sort portion


The do-while is generally less readable than using a for-loop, and is preferably only used when it's very necessary - for example, if you need to ensure at least one execution of the loop.


For the Binary Search portion


A more standard-used naming convention for the variables used in binary search are:


i: low (indicating the start of the search segment)
count: high (the end of the search segment)
midval(): mid (the middle value you compute once, and compare to in a given iteration)
search: target (the value you are searching for)

You are repeating the call to the midval function several times in the code. Instead, you can compute this value once at the start of the loop, and use the computed value later on. 


General comments


As you did with some parts of your code, you should also extract out separate functions for Bubble Sort and Binary Search. This not only improves reusability, but also makes your code more readable.
It will be very helpful as you learn more to look for standard implementations of different algorithms to solidify your understanding and style (after you try to implement them yourself of course!). Generally you want to write code that's readable to other people, which is easier to do when you use standard practices.