solve the famous josephus problem using c++ using circular queue and by using arrays

C++Create 1 million integers randomly and store them in an array. Find the 100 smallest integers and print them. Use a Priority Queue implemented by Heap using array, and print the execution time too.

Write a C++ program that:   (1) defines and implements a hash class that constructs a 15 element array (may be implemented using a vector, a deque, or a list, if you prefer, (using the STL implementations), storing strings, using the following hash function:   ((first_letter) + (last_letter) - (second_letter))% 15   (2) the driver program should:   a. query the user for ten words and store them using the hash technique described above.   b. print out the contents of each position of the array (or vector, deque, or whatever you used), showing vacant as well as filled positions. Remember, only 10 of the 15 positions will be filled.   c. repeatedly query the user for a target word, hash the word, check for its inclusion in the list of stored words, and report the result. Continue doing this task until the user signals to stop (establish a sentinel condition).

Code you provide code in python?

Write a C++ code (function) to search an element in a queue? Also assume the situation that, you are adding required function in a code that already solved the issue of array implementation of queue when there is space but you cannot enter more elements?

Write a C++ code that compare the times to traverse a list (containing a large number of elements) implemented in an array, in a simple linked list, and in an unrolled linked list.

Implement a C++ program to store Strings in Binary Search tree. Your program should have following functions: Insert Display Search Data structures in C++

write a recursive function in F#, named indexWiseMax, that takes two list of integers and outputs the index-wise maximum values of two lists. use pattern matching to receive the arguments, lst1, and lst2 and return a list that has the max element for each index of both lists. let rec indexWiseMax lst1 lst2 = match lst1, lst2 with

Write a LISP function f10 that finds the intersection of two lists. The intersection meansthe common elements of the two lists. Example: (f10 ‘(a (a b) c d) ‘(b(a b) d)) returns ((a b) d) CAN ONLY USE CAR AND CDR AND RECURSION SETQ AND DO LIST CANT BE USED