【綜合練習】排程演算法：實作 3 - 問題副本 | 程式專案

{"id":720688,"student_id":7022,"content":"{\"html\":\"\u003c!DOCTYPE html\u003e\\n\u003chtml\u003e\\n\u003chead\u003e\\n\\t\u003ctitle\u003eDocument\u003c/title\u003e\\n\u003c/head\u003e\\n\u003cbody\u003e\\n    \u003cdiv id=\\\"screenshot\\\"\u003e\\n        \u003cp\u003e題目：\u003c/p\u003e\\n        \u003cdiv id=\\\"log\\\"\u003eloading...\u003c/div\u003e\\n    \u003c/div\u003e\\n\u003c/body\u003e\\n\u003c/html\u003e\",\"css\":\"* {\\n    margin: 0;\\n    padding: 0;\\n    box-sizing: border-box;\\n    font-size: 16px;\\n}\\n\\nhtml, body {\\n    width: 100%;\\n    height: 100%;\\n    background-color: #333;\\n    padding: 10px;\\n}\\n\\np {\\n    color: white;\\n    margin-bottom: 10px;\\n}\\n\\n#log {\\n    color: #03F501;\\n    padding: 10px;\\n    border: 1px solid white;\\n    border-radius: 5px;\\n}\\n\\n#code {\\n    color: #03F501;\\n    padding: 10px;\\n    border: 1px solid white;\\n    border-radius: 5px;\\n    overflow-x: scroll;\\n}\\n\\n#question {\\n    height: 130px;\\n    border: 1px solid white;\\n    padding: 20px;\\n    margin-bottom: 10px;\\n}\\n\\n#screenshot {\\n    border: 1px solid white;\\n    padding: 20px;\\n    margin-bottom: 10px;\\n}\",\"js\":\"// 最短優先函式\\r\\nfunction shortestJobFirst(processes) {\\r\\n  const sortedProcesses = [...processes]; // 複製一份原始的作業列表\\r\\n  sortedProcesses.sort((a, b) =\u003e a.executionTime - b.executionTime); // 根據執行時間對作業進行排序\\r\\n  let currentTime = 0; // 目前的時間\\r\\n  let waitingTime = 0; // 等待時間總和\\r\\n  for (let i = 0; i \u003c sortedProcesses.length; i++) {\\r\\n    const process = sortedProcesses[i]; // 取出一個作業\\r\\n    waitingTime += currentTime; // 累加等待時間\\r\\n    currentTime += process.executionTime; // 更新目前時間\\r\\n    let { id, executionTime } = process; // 取出作業的 ID 和執行時間\\r\\n    console.log(`Process ${id}: 執行時間 ${executionTime}, 等待時間 ${waitingTime}`);\\r\\n  }\\r\\n}\\r\\n\\r\\n// 定義作業列表\\r\\nconst processes = [\\r\\n  { id: 1, executionTime: 6 },\\r\\n  { id: 2, executionTime: 2 },\\r\\n  { id: 3, executionTime: 8 },\\r\\n  { id: 4, executionTime: 3 },\\r\\n  { id: 5, executionTime: 4 },\\r\\n];\\r\\n\\r\\n// 呼叫最短優先函式，傳入作業列表\\r\\nshortestJobFirst(processes);\"}","created_at":"2024-03-24T17:22:31.801+08:00","updated_at":"2024-03-24T17:23:27.899+08:00","name":"【綜合練習】排程演算法：實作 3 - 問題 副本","language":"web","screenshot":{"url":"https://cdn7.koding.school/uploads/project/screenshot/720688/0db38546b3d8c7644f5c80faf77cf379.jpg"},"parent_id":576367,"plugin":"(function () {\n    if (!console) {\n        console = {};\n    }\n    var old = console.log;\n    var logger = document.getElementById('log');\n    logger.innerHTML = \"\"\n    console.log = function (message) {\n        if (typeof message == 'object') {\n            logger.innerHTML += (JSON \u0026\u0026 JSON.stringify ? JSON.stringify(message) : String(message)) + '\u003cbr /\u003e';\n        } else {\n            logger.innerHTML += message + '\u003cbr /\u003e';\n        }\n    }\n})();","description":null,"note":null,"status":"public","like_student_ids":[],"is_featured":false,"views":10,"hashid":"qmdswjqve","is_content_changed":false,"review_status":"unsubmitted","submitted_at":null,"reviewed_at":null,"advise":null,"is_deleted":false}