unordered

An unordered array search time complexity is which of the following

Using unordered Array: In unordered array deletion takes O (n) time complexity because it search for the element in Queue for the deletion and enqueue takes o (1) time complexity. Implementing Priority Queue (Unordered)