Implement a recursive divide and conquer algorithm that finds the largest prime number in a list of integers. A prime number is a number that is only evenly divisible by itself and 1 (1,2, 3, 5, 7, 11, etc). It should meet the following requirements: The program shall determine which of the integers is the largest prime or indicate if there are no prime numbers.
The program shall use a recursive divide and conquer algorithm to find the largest prime number.
The program shall use a graphical user interface to allow the user to select a file from any location on their computer. Contain a list of prime number for the program.