#Look scheduling algorithm code

#Look scheduling algorithm code

Such user interaction should not appear at construction, but be handled later by the client code of the class. I'm not at ease with using std::cin in the constructor of disk.Therefore, your functions CSCAN and LOOK (and the other ones) should be named cscan and look instead. Upper case names should only be used for preprocessor macros.I can't cover all your code because it would have to be refactored to use more standard library features beforehand, but here are some notes: You can replace this line: qsort(sorted_request+1,number_of_request,sizeof(int),compare) Д«y this one: std::sort(std::begin(sorted_request), std::end(sorted_request)) It should be at least as fast (if not faster) and easier to read and write. Instead of the old qsort, which requires to take a function pointer with void* pointers and do some ugly casts, you should use std::sort in the standard header. For example, a fixed sized array int arr can be replaced by the equivalent std::array in C++11 (this container is not directly available in the older versions of the standard). Instead of using old C arrays and pointers, you can use standard library containers. That helps to check whether some header has already been included or not, and to avoid including twice some header. Also, it's good practice to organize your include directives in alphabetical ordering.For input/output operations, you should generally use and stick with it. is a C header, in C++, you should include instead, which is its C++ equivalent.You should just add std:: before every function/calss/variable from the standard library. Wirting using namespace std is generally considered bad practice, especially when written in the global namesapce: it leads to potential name clashes and namespace pollution. There are numerous ways to improve your code readability by replacing C standard features by C++ ones. You are using C++, but overall, your code looks like C. Head_movement+=abs(sorted_request-sorted_request) Head_movement+=sorted_request-sorted_request Head_movement+=abs(request-request) Д®lse if((request-request)>(request-request)) If(request>max||requestsorted_request&flag=0) Int compare (const void * a, const void * b) C Program to Simulate LOOK Disk Scheduling Algorithm //visit for more programs.Aim is to provide total head movement in different disk scheduling algorithms namely FCFS, SSTF, LOOK, C-LOOK, SCAN, C-SCAN. Now you may read the comments on the code itself to understand the rest of it. This is basically the logic of this code. And then we simply sort these arrays so that the queue1 array is in ascending order since we have to move the disk head towards the outer end and queue2 in the descending order. Any value greater than initial headposition goes to queue1 and any value less than headposition goes to queue2. We simply perform a condition check when reading the request queue and put it into two different arrays called queue1 and queue2. What we are doing here is that we read the maxrange(not necessary in this case but we still read it to make the code adaptable to other scheduling algorithms), initial headposition and then the request queue. Now let's see the C program to implement this.Дon't worry about understanding the code logic because I have tried my best to comment out literally every single line of code in order to make the logic easy to understand. Therefore, the LOOK algorithm is considered to be a slightly more efficient version of the SCAN disk scheduling algorithm. That is, the disk head doesn't have to unnecessarily move to the extreme ends (outermost cylinder and innermost cylinder) for no reason.