Design an algorithm to determine the optimal execution order of jobs in a CI/CD pipeline, given a list of jobs and their dependencies. Your solution should handle cycles and prioritize jobs with no dependencies first, with a focus on time and space complexity.

Model jobs and dependencies as a directed graph. Use Kahn's algorithm for topological sorting to prioritize jobs with no dependencies. Track in-degrees of nodes and process nodes with zero in-degree first. If cycles are detected (remaining unprocessed nodes), handle them by reporting or breaking the cycle. This ensures optimal execution order while respecting dependencies.

The solution uses a topological sorting approach with Kahn's algorithm. Jobs are represented as nodes in a directed graph, with edges indicating dependencies. We calculate in-degrees for each node and use a queue to process nodes with zero in-degree first. As each node is processed, its dependents' in-degrees are decremented. If all nodes are processed, the order is valid. If not, a cycle exists. Time complexity is O(V + E) for graph traversal, where V is jobs and E is dependencies. Space complexity is O(V + E) for adjacency lists and in-degree tracking. This approach ensures optimal execution order while detecting cycles.