The answer & explanation for this question is given in the attachment below.
Answer:
Idk if an app is ok too but for an app there is one called monkey. my friend showed it me. you can meet a loy of new people on there. its a speed video call with everyone. I think you get 30 seconds and if you want to talk more then you just add time or add each other as friends
Answer:
1. Identification of a vacancy and development of the job description.
2. Recruitment planning
3. Advertising
4. Assessment and Interview of applicants
5. Selection and Appointment of candidates
6. Onboarding
Explanation:
The Recruitment process refers to all the stages in the planning, assessment, and absorption of candidates in an organization. The stages involved include;
1. Identification of a vacancy and development of the job description: This is the stage where an obvious need in the organization is identified and the duties of the job requirement are stipulated.
2. Recruitment planning: This is the stage where the HR team comes together to discuss the specific ways they can attract qualified candidates for the job.
3. Advertising: The HR team at this point seeks out job sites, newspapers, and other platforms that will make the opportunities accessible to applicants.
4. Assessment and Interview of applicants: Assessments are conducted to gauge the candidates' knowledge and thinking abilities. This will provide insight into their suitability for the job.
5. Selection and Appointment of candidates: Successful candidates are appointed to their respective positions. A letter of appointment is given.
6. Onboarding: Candidates are trained and guided as to the best ways of discharging their duties.
Answer:
The answer to this question is O(NlogN).
Explanation:
The time complexity of Heap Sort on an array A is O(NLogN) even if the array is already sorted in increasing order.Since the Heap Sort is implemented by creating the heap from the array and then heapifying and then repeatedly swapping first and last element and deleting the last element.The process will be done for the whole array.So the running time complexity is O(NLogN).
