最近の投稿で使用されている最もインパクトのあるハッシュタグを探索。これらのタグは、このプロフィールのデジタル影響力とコンテンツ戦略を定義するコア関心事とトレンドトピックを強調しています。
![Dealing DSA day 0/60 [coding, dsa, computer science engineering] #explorepage #boost #coding #fypppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppp #engineering](https://image.pictame.com/img/641302510_17856364611669743_1048259738966957949_n.jpg?hash=aHR0cHM6Ly9zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbS92L3Q1MS44Mjc4Ny0xNS82NDEzMDI1MTBfMTc4NTYzNjQ2MTE2Njk3NDNfMTA0ODI1OTczODk2Njk1Nzk0OV9uLmpwZz9zdHA9ZHN0LWpwZ19lMTVfdHQ2Jl9uY19odD1zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbSZfbmNfY2F0PTExMSZfbmNfb2M9UTZjWjJnSHIwd0dCenVuRnNVNXNHZXR1QUZHS1ZweW1fNXV5WnBwNUNXZnQ2ejVtaWFqMW5ZU0taVmlzc2c5Ykx2MUdBVncmX25jX29oYz1oSlFtVy1ZYkFLMFE3a052d0VpNkR3ZyZfbmNfZ2lkPWEzVm9iTVdhUEl4UnBXajdQWGNGT2cmZWRtPUFQVTg5RkFCQUFBQSZjY2I9Ny01Jm9oPTAwX0FmeUFkUzJhU2ZLc09VY1NQOXNrMFgxbHdjR1hoYnliYnhNRk9FWllWVVEyTmcmb2U9NjlDRkQ3MzcmX25jX3NpZD1iYzBjMmM=)

![Pseudocode👇 for i = 0 to n-1 for j = i+1 to n-1 if arr[i] + arr[j] == target return i, j return -1 // if no pair found Example: arr = [2, 7, 11, 15] target = 9 i = 0 → arr[i] = 2 j = 1 → 2](https://image.pictame.com/img/656443353_17861594202669743_6092975059657303973_n.jpg?hash=aHR0cHM6Ly9zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbS92L3Q1MS44Mjc4Ny0xNS82NTY0NDMzNTNfMTc4NjE1OTQyMDI2Njk3NDNfNjA5Mjk3NTA1OTY1NzMwMzk3M19uLmpwZz9zdHA9ZHN0LWpwZ19lMTVfdHQ2Jl9uY19odD1zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbSZfbmNfY2F0PTExMSZfbmNfb2M9UTZjWjJnSHIwd0dCenVuRnNVNXNHZXR1QUZHS1ZweW1fNXV5WnBwNUNXZnQ2ejVtaWFqMW5ZU0taVmlzc2c5Ykx2MUdBVncmX25jX29oYz1yTkx1RklxME9UVVE3a052d0V0Tjh2OCZfbmNfZ2lkPWEzVm9iTVdhUEl4UnBXajdQWGNGT2cmZWRtPUFQVTg5RkFCQUFBQSZjY2I9Ny01Jm9oPTAwX0FmeDNDN2IySmJaV0c4MmpPY3JJSHpsZjBYSjhRU1RWWml2TWxFenFKZUQ4SkEmb2U9NjlEMDBCNDYmX25jX3NpZD1iYzBjMmM=)
![🔹 INSERTION SORT – PSEUDOCODE InsertionSort(arr, n): for i = 1 to n-1: key = arr[i] j = i - 1 while j >= 0 AND arr[j] > key: arr[j + 1] = arr[j] j = j - 1 arr[j + 1] = key 🔹 ARRAY: 5 2](https://image.pictame.com/img/655155062_17861085498669743_973389719564235197_n.jpg?hash=aHR0cHM6Ly9zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbS92L3Q1MS44Mjc4Ny0xNS82NTUxNTUwNjJfMTc4NjEwODU0OTg2Njk3NDNfOTczMzg5NzE5NTY0MjM1MTk3X24uanBnP3N0cD1kc3QtanBnX2UxNV90dDYmX25jX2h0PXNjb250ZW50LXdhdzItMS5jZG5pbnN0YWdyYW0uY29tJl9uY19jYXQ9MTExJl9uY19vYz1RNmNaMmdIcjB3R0J6dW5Gc1U1c0dldHVBRkdLVnB5bV81dXlacHA1Q1dmdDZ6NW1pYWoxbllTS1pWaXNzZzliTHYxR0FWdyZfbmNfb2hjPXFVY0NIaWlvSlVvUTdrTnZ3R2pFTWZ2Jl9uY19naWQ9YTNWb2JNV2FQSXhScFdqN1BYY0ZPZyZlZG09QVBVODlGQUJBQUFBJmNjYj03LTUmb2g9MDBfQWZ5eEt6bDBUWEJ3VUkzMzdYSW1rbWhrMHRkblhQR2ZScnI5X19MQkpUNEgzUSZvZT02OUNGRUMzOCZfbmNfc2lkPWJjMGMyYw==)
![Selection Sort IMPORTANT: WE SET "min" to index(address) BECAUSE WE USE IT TO SWAP LATER. for i = 0 → n-2 min = i for j = i+1 → n-1 if arr[j] < arr[min] min = j swap(arr[i], arr[min]) Time](https://image.pictame.com/img/654892628_17860861437669743_6975196666472404300_n.jpg?hash=aHR0cHM6Ly9zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbS92L3Q1MS44Mjc4Ny0xNS82NTQ4OTI2MjhfMTc4NjA4NjE0Mzc2Njk3NDNfNjk3NTE5NjY2NjQ3MjQwNDMwMF9uLmpwZz9zdHA9ZHN0LWpwZ19lMTVfdHQ2Jl9uY19odD1zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbSZfbmNfY2F0PTExMSZfbmNfb2M9UTZjWjJnSHIwd0dCenVuRnNVNXNHZXR1QUZHS1ZweW1fNXV5WnBwNUNXZnQ2ejVtaWFqMW5ZU0taVmlzc2c5Ykx2MUdBVncmX25jX29oYz1sWmRYQ1h3OU5Db1E3a052d0hsTlJlTyZfbmNfZ2lkPWEzVm9iTVdhUEl4UnBXajdQWGNGT2cmZWRtPUFQVTg5RkFCQUFBQSZjY2I9Ny01Jm9oPTAwX0FmeGxUY09ad0JaUl83c1pSMkQtSlJuYU1hbVYtTHFGWlowUmxjdlZCOXQwV2cmb2U9NjlDRkUzQUEmX25jX3NpZD1iYzBjMmM=)
![By set to 0 i meant it is set to false(boolean variable) EXAMPLE ARRAY: [1, 2, 3, 5, 4] NORMAL BUBBLE SORT Pass 1: (1,2) ✔ (2,3) ✔ (3,5) ✔ (5,4) ❌ swap → [1,2,3,4,5] Pass 2: (1,2) ✔ (2,3) ✔ (3,4) ✔](https://image.pictame.com/img/656545651_17860591281669743_2582994942629415671_n.jpg?hash=aHR0cHM6Ly9zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbS92L3Q1MS44Mjc4Ny0xNS82NTY1NDU2NTFfMTc4NjA1OTEyODE2Njk3NDNfMjU4Mjk5NDk0MjYyOTQxNTY3MV9uLmpwZz9zdHA9ZHN0LWpwZ19lMTVfdHQ2Jl9uY19odD1zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbSZfbmNfY2F0PTExMSZfbmNfb2M9UTZjWjJnSHIwd0dCenVuRnNVNXNHZXR1QUZHS1ZweW1fNXV5WnBwNUNXZnQ2ejVtaWFqMW5ZU0taVmlzc2c5Ykx2MUdBVncmX25jX29oYz1ocXFwUkNzSG9iY1E3a052d0hZMTNtWSZfbmNfZ2lkPWEzVm9iTVdhUEl4UnBXajdQWGNGT2cmZWRtPUFQVTg5RkFCQUFBQSZjY2I9Ny01Jm9oPTAwX0Fmd0ZSVk9CRG5WYTkxZDlCMmlqWDIxQWhDVnVwSktPeUxzZkJ6VnZkenhIMUEmb2U9NjlEMDBBQTImX25jX3NpZD1iYzBjMmM=)
![Bubble sort explained 👇 Consider array: [5, 4, 3, 1, 2] 5 > 4 → swap [4, 5, 3, 1, 2] 5 > 3 → swap [4, 3, 5, 1, 2]] 5 > 1 → swap [4, 3, 1, 5, 2] 5 > 2 → swap [4, 3, 1, 2, 5] Continues the sam](https://image.pictame.com/img/655192657_17860313592669743_5555943502002161468_n.jpg?hash=aHR0cHM6Ly9zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbS92L3Q1MS44Mjc4Ny0xNS82NTUxOTI2NTdfMTc4NjAzMTM1OTI2Njk3NDNfNTU1NTk0MzUwMjAwMjE2MTQ2OF9uLmpwZz9zdHA9ZHN0LWpwZ19lMTVfdHQ2Jl9uY19odD1zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbSZfbmNfY2F0PTExMSZfbmNfb2M9UTZjWjJnSHIwd0dCenVuRnNVNXNHZXR1QUZHS1ZweW1fNXV5WnBwNUNXZnQ2ejVtaWFqMW5ZU0taVmlzc2c5Ykx2MUdBVncmX25jX29oYz1ZVENFWEhCa0Nfd1E3a052d0VsVlEtMCZfbmNfZ2lkPWEzVm9iTVdhUEl4UnBXajdQWGNGT2cmZWRtPUFQVTg5RkFCQUFBQSZjY2I9Ny01Jm9oPTAwX0Fmd3FMUFRmWElRbG8xUl9YNGxhVzVWR25JUWdoS0FRbFdIUFl4SlF6QkJsQVEmb2U9NjlEMDA1REEmX25jX3NpZD1iYzBjMmM=)
![Linear Search for i = 0 → n-1 if arr[i] == key return i return -1 Time Complexity: O(n) Space Complexity: O(1) [Coding, dsa, computer science engineering] #explorepage #boost #fyp #coding #dsa](https://image.pictame.com/img/654691372_17860015629669743_4089589643470799126_n.jpg?hash=aHR0cHM6Ly9zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbS92L3Q1MS44Mjc4Ny0xNS82NTQ2OTEzNzJfMTc4NjAwMTU2Mjk2Njk3NDNfNDA4OTU4OTY0MzQ3MDc5OTEyNl9uLmpwZz9zdHA9ZHN0LWpwZ19lMTVfdHQ2Jl9uY19odD1zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbSZfbmNfY2F0PTExMSZfbmNfb2M9UTZjWjJnSHIwd0dCenVuRnNVNXNHZXR1QUZHS1ZweW1fNXV5WnBwNUNXZnQ2ejVtaWFqMW5ZU0taVmlzc2c5Ykx2MUdBVncmX25jX29oYz1DVEJqaVR4MGEySVE3a052d0dhemhsUyZfbmNfZ2lkPWEzVm9iTVdhUEl4UnBXajdQWGNGT2cmZWRtPUFQVTg5RkFCQUFBQSZjY2I9Ny01Jm9oPTAwX0FmeEI5Zk1vQjR3VWVMbUt2Z0ZGUUs0Q2NqaEJfOWNma2Q4NldOalBRZmE4NlEmb2U9NjlDRkZBREQmX25jX3NpZD1iYzBjMmM=)
![Pseudocode: FOR i = pos TO n-2 A[i] = A[i+1] Time complexity : O(n) [Coding, dsa, computer science engineering] #explorepage #fyp #boost #coding #dsa](https://image.pictame.com/img/651025465_17858633499669743_3956118334312624946_n.jpg?hash=aHR0cHM6Ly9zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbS92L3Q1MS44Mjc4Ny0xNS82NTEwMjU0NjVfMTc4NTg2MzM0OTk2Njk3NDNfMzk1NjExODMzNDMxMjYyNDk0Nl9uLmpwZz9zdHA9ZHN0LWpwZ19lMTVfdHQ2Jl9uY19odD1zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbSZfbmNfY2F0PTExMSZfbmNfb2M9UTZjWjJnSHIwd0dCenVuRnNVNXNHZXR1QUZHS1ZweW1fNXV5WnBwNUNXZnQ2ejVtaWFqMW5ZU0taVmlzc2c5Ykx2MUdBVncmX25jX29oYz1WQTRsQXFkU3ZPTVE3a052d0ZNZzl4QiZfbmNfZ2lkPWEzVm9iTVdhUEl4UnBXajdQWGNGT2cmZWRtPUFQVTg5RkFCQUFBQSZjY2I9Ny01Jm9oPTAwX0FmdzRrdzA1bFYtdHFEREJUM0VTOXlxT0ttUk9oQ0NlQWtGY2N2dUtWZEFyLXcmb2U9NjlDRkRGN0EmX25jX3NpZD1iYzBjMmM=)

![Insertion in Static Array pseudocode 👇 for i from (n-1) to position arr[i+1]=arr[i] arr[position -1]=value "position-1" because indexing of array starts from 0 and position numbering starts from 1.](https://image.pictame.com/img/651657414_17858218644669743_7019869323569388018_n.jpg?hash=aHR0cHM6Ly9zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbS92L3Q1MS44Mjc4Ny0xNS82NTE2NTc0MTRfMTc4NTgyMTg2NDQ2Njk3NDNfNzAxOTg2OTMyMzU2OTM4ODAxOF9uLmpwZz9zdHA9ZHN0LWpwZ19lMTVfdHQ2Jl9uY19odD1zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbSZfbmNfY2F0PTExMSZfbmNfb2M9UTZjWjJnSHIwd0dCenVuRnNVNXNHZXR1QUZHS1ZweW1fNXV5WnBwNUNXZnQ2ejVtaWFqMW5ZU0taVmlzc2c5Ykx2MUdBVncmX25jX29oYz04VFZwVGI1ejRvZ1E3a052d0drckRwTCZfbmNfZ2lkPWEzVm9iTVdhUEl4UnBXajdQWGNGT2cmZWRtPUFQVTg5RkFCQUFBQSZjY2I9Ny01Jm9oPTAwX0FmdzAzODg3V3V5X2pNWmlHNUM4QlNsX05xaEZQVUwyMWZVV1VyeGdQSXY0elEmb2U9NjlDRkYwNkMmX25jX3NpZD1iYzBjMmM=)
![Array Traversal👇 pseudocode for i = 0 → n-1 access arr[i] Time Complexity → O(n) Space Complexity → O(1) Let me know if entire working code is needed. Dealing dsa day 8/60 [Coding, dsa, compute](https://image.pictame.com/img/650038504_17858010654669743_2574270678860301763_n.jpg?hash=aHR0cHM6Ly9zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbS92L3Q1MS44Mjc4Ny0xNS82NTAwMzg1MDRfMTc4NTgwMTA2NTQ2Njk3NDNfMjU3NDI3MDY3ODg2MDMwMTc2M19uLmpwZz9zdHA9ZHN0LWpwZ19lMTVfdHQ2Jl9uY19odD1zY29udGVudC13YXcyLTEuY2RuaW5zdGFncmFtLmNvbSZfbmNfY2F0PTExMSZfbmNfb2M9UTZjWjJnSHIwd0dCenVuRnNVNXNHZXR1QUZHS1ZweW1fNXV5WnBwNUNXZnQ2ejVtaWFqMW5ZU0taVmlzc2c5Ykx2MUdBVncmX25jX29oYz1vNmNKT25JMTUyRVE3a052d0hyYTFybSZfbmNfZ2lkPWEzVm9iTVdhUEl4UnBXajdQWGNGT2cmZWRtPUFQVTg5RkFCQUFBQSZjY2I9Ny01Jm9oPTAwX0FmeTJDXzBtM252TnpCZEpXelU2N3JRMXdyTDQyR0syb2ZjVFBOc1lXejczdHcmb2U9NjlDRkYyMUImX25jX3NpZD1iYzBjMmM=)
Siri👾🌻はInstagramの成長中のクリエイターで、Educationカテゴリーに所属しています。292人のフォロワーと32件の投稿があり、void.siriアカウントのフォロワー対フォロー比率は10.4:1です。 Pictameですべてのコンテンツを匿名で表示 - ログイン不要。
void.siriのエンゲージメント率は1.23%です。1K-10Kフォロワー帯のアカウントの平均は5%前後なので成長の余地がありますが、コミュニティはそれぞれ独自です。
直近12件の投稿のうち、100%が動画、0%が写真です。 約2日ごとに新しい投稿があり、安定したリズムです。 キャプションは中程度のスタイルで、平均441文字です。
このプロフィールを閲覧しています 匿名で. ログインなし。アクティビティ追跡なし。公開コンテンツのみ。