Answer:
Check the explanation
Explanation:
Assuming Cust_code is unique for every customer.
Query :
SELECT * FROM CUSTOMER WHERE CUST_STATE= "AL" GROUP BY CUST_CODE HAVING LARGEST INVOICE = MAX(LARGEST INVOICE) OR (LARGEST INVOICE =0 and INV_DATE IS NULL);
D you can always find another way or other ways to relay your message
hope this helps ya :)
Explanation:
Copy the code as many times as needed so that each usage is separate.
Answer:
Worst case time of Heapsort is better than worst case time of Quicksort.
Explanation:
Worstcase of Heapsort is nlog(n). Worstcase time of Quicksort is (n^2). Heapsort is comparison based sorting algorithm. Heapsort divides input into sorting. It is a selection sort in which we send maximum inputs for maximum elements at end. Quicksort is divide and conquer algorithm. It is considered as efficient sourcing algorithm.
Maybe like 3-5 I think im right
